//package atcoder;
 
import java.util.*;
import java.math.BigDecimal;
 
public class Main{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int A[] = new int[N];
		for(int i=0;i<N;i++) {
			A[i] = sc.nextInt();
		}
		boolean gu[] = new boolean[N];
		Arrays.fill(gu,false);
		int count = 0;
		for(int j=0;j<N;j++) {
			if(A[j]%2==0) {
				gu[j] = true;
				count ++;
			}
		}
//		for(int k=0;k<N;k++) {
//			System.out.println(gu[k]);
//		}
		int count2 = 0;
		for(int k=0;k<N;k++) {
			if(gu[k]) {
				if(A[k]%3==0||A[k]%5==0) {
					count2 ++;
				}
			}
		}
		if(count==count2) {
			System.out.println("APPROVED");
		}else {
			System.out.println("DENIED");
		}
	}
} import java.util.*; util.* java import java.math.BigDecimal; BigDecimal java.math public class Main{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int A[] = new int[N];
		for(int i=0;i<N;i++) {
			A[i] = sc.nextInt();
		}
		boolean gu[] = new boolean[N];
		Arrays.fill(gu,false);
		int count = 0;
		for(int j=0;j<N;j++) {
			if(A[j]%2==0) {
				gu[j] = true;
				count ++;
			}
		}
//		for(int k=0;k<N;k++) {
//			System.out.println(gu[k]);
//		}
		int count2 = 0;
		for(int k=0;k<N;k++) {
			if(gu[k]) {
				if(A[k]%3==0||A[k]%5==0) {
					count2 ++;
				}
			}
		}
		if(count==count2) {
			System.out.println("APPROVED");
		}else {
			System.out.println("DENIED");
		}
	}
} Main public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int A[] = new int[N];
		for(int i=0;i<N;i++) {
			A[i] = sc.nextInt();
		}
		boolean gu[] = new boolean[N];
		Arrays.fill(gu,false);
		int count = 0;
		for(int j=0;j<N;j++) {
			if(A[j]%2==0) {
				gu[j] = true;
				count ++;
			}
		}
//		for(int k=0;k<N;k++) {
//			System.out.println(gu[k]);
//		}
		int count2 = 0;
		for(int k=0;k<N;k++) {
			if(gu[k]) {
				if(A[k]%3==0||A[k]%5==0) {
					count2 ++;
				}
			}
		}
		if(count==count2) {
			System.out.println("APPROVED");
		}else {
			System.out.println("DENIED");
		}
	} main {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int A[] = new int[N];
		for(int i=0;i<N;i++) {
			A[i] = sc.nextInt();
		}
		boolean gu[] = new boolean[N];
		Arrays.fill(gu,false);
		int count = 0;
		for(int j=0;j<N;j++) {
			if(A[j]%2==0) {
				gu[j] = true;
				count ++;
			}
		}
//		for(int k=0;k<N;k++) {
//			System.out.println(gu[k]);
//		}
		int count2 = 0;
		for(int k=0;k<N;k++) {
			if(gu[k]) {
				if(A[k]%3==0||A[k]%5==0) {
					count2 ++;
				}
			}
		}
		if(count==count2) {
			System.out.println("APPROVED");
		}else {
			System.out.println("DENIED");
		}
	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int N = sc.nextInt(); N sc.nextInt() sc.nextInt sc int A[] = new int[N]; A new int[N] N for(int i=0;i<N;i++) {
			A[i] = sc.nextInt();
		} int i=0; int i=0; i 0 i<N i N i++ i++ i {
			A[i] = sc.nextInt();
		} {
			A[i] = sc.nextInt();
		} A[i] = sc.nextInt() A[i] A i sc.nextInt() sc.nextInt sc boolean gu[] = new boolean[N]; gu new boolean[N] N Arrays.fill(gu,false) Arrays.fill Arrays gu false int count = 0; count 0 for(int j=0;j<N;j++) {
			if(A[j]%2==0) {
				gu[j] = true;
				count ++;
			}
		} int j=0; int j=0; j 0 j<N j N j++ j++ j {
			if(A[j]%2==0) {
				gu[j] = true;
				count ++;
			}
		} {
			if(A[j]%2==0) {
				gu[j] = true;
				count ++;
			}
		} if(A[j]%2==0) {
				gu[j] = true;
				count ++;
			} A[j]%2==0 A[j]%2 A[j] A j 2 0 {
				gu[j] = true;
				count ++;
			} gu[j] = true gu[j] gu j true count ++ count int count2 = 0; count2 0 for(int k=0;k<N;k++) {
			if(gu[k]) {
				if(A[k]%3==0||A[k]%5==0) {
					count2 ++;
				}
			}
		} int k=0; int k=0; k 0 k<N k N k++ k++ k {
			if(gu[k]) {
				if(A[k]%3==0||A[k]%5==0) {
					count2 ++;
				}
			}
		} {
			if(gu[k]) {
				if(A[k]%3==0||A[k]%5==0) {
					count2 ++;
				}
			}
		} if(gu[k]) {
				if(A[k]%3==0||A[k]%5==0) {
					count2 ++;
				}
			} gu[k] gu k {
				if(A[k]%3==0||A[k]%5==0) {
					count2 ++;
				}
			} if(A[k]%3==0||A[k]%5==0) {
					count2 ++;
				} A[k]%3==0||A[k]%5==0 A[k]%3==0 A[k]%3 A[k] A k 3 0 A[k]%5==0 A[k]%5 A[k] A k 5 0 {
					count2 ++;
				} count2 ++ count2 if(count==count2) {
			System.out.println("APPROVED");
		}else {
			System.out.println("DENIED");
		} count==count2 count count2 {
			System.out.println("APPROVED");
		} System.out.println("APPROVED") System.out.println System.out System System.out "APPROVED" {
			System.out.println("DENIED");
		} System.out.println("DENIED") System.out.println System.out System System.out "DENIED" String[] args args public class Main{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int A[] = new int[N];
		for(int i=0;i<N;i++) {
			A[i] = sc.nextInt();
		}
		boolean gu[] = new boolean[N];
		Arrays.fill(gu,false);
		int count = 0;
		for(int j=0;j<N;j++) {
			if(A[j]%2==0) {
				gu[j] = true;
				count ++;
			}
		}
//		for(int k=0;k<N;k++) {
//			System.out.println(gu[k]);
//		}
		int count2 = 0;
		for(int k=0;k<N;k++) {
			if(gu[k]) {
				if(A[k]%3==0||A[k]%5==0) {
					count2 ++;
				}
			}
		}
		if(count==count2) {
			System.out.println("APPROVED");
		}else {
			System.out.println("DENIED");
		}
	}
} public class Main{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int A[] = new int[N];
		for(int i=0;i<N;i++) {
			A[i] = sc.nextInt();
		}
		boolean gu[] = new boolean[N];
		Arrays.fill(gu,false);
		int count = 0;
		for(int j=0;j<N;j++) {
			if(A[j]%2==0) {
				gu[j] = true;
				count ++;
			}
		}
//		for(int k=0;k<N;k++) {
//			System.out.println(gu[k]);
//		}
		int count2 = 0;
		for(int k=0;k<N;k++) {
			if(gu[k]) {
				if(A[k]%3==0||A[k]%5==0) {
					count2 ++;
				}
			}
		}
		if(count==count2) {
			System.out.println("APPROVED");
		}else {
			System.out.println("DENIED");
		}
	}
} Main
//package atcoder;
 
import java.util.*;
import java.math.BigDecimal;
 
public class Main{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int A[] = new int[N];
		for(int i=0;i<N;i++) {
			A[i] = sc.nextInt();
		}
		boolean gu[] = new boolean[N];
		Arrays.fill(gu,false);
		int count = 0;
		for(int j=0;j<N;j++) {
			if(A[j]%2==0) {
				gu[j] = true;
				count ++;
			}
		}
//		for(int k=0;k<N;k++) {
//			System.out.println(gu[k]);
//		}
		int count2 = 0;
		for(int k=0;k<N;k++) {
			if(gu[k]) {
				if(A[k]%3==0||A[k]%5==0) {
					count2 ++;
				}
			}
		}
		if(count==count2) {
			System.out.println("APPROVED");
		}else {
			System.out.println("DENIED");
		}
	}
}