Iahub and Iahubina went to a picnic in a forest full of trees. Less than 5 minutes passed before Iahub remembered of trees from programming. Moreover, he invented a new problem and Iahubina has to solve it, otherwise Iahub won't give her the food. 

Iahub asks Iahubina: can you build a rooted tree, such that

  * each internal node (a node with at least one son) has at least two sons; 
  * node i has ci nodes in its subtree? 



Iahubina has to guess the tree. Being a smart girl, she realized that it's possible no tree can follow Iahub's restrictions. In this way, Iahub will eat all the food. You need to help Iahubina: determine if there's at least one tree following Iahub's restrictions. The required tree must contain n nodes.

Input

The first line of the input contains integer n (1 ≤ n ≤ 24). Next line contains n positive integers: the i-th number represents ci (1 ≤ ci ≤ n).

Output

Output on the first line "YES" (without quotes) if there exist at least one tree following Iahub's restrictions, otherwise output "NO" (without quotes). 

Examples

Input

4
1 1 1 4


Output

YES

Input

5
1 1 5 2 1


Output

NO
import java.util.*;
import java.io.*;

public class C {
	FastScanner in;
	PrintWriter out;

	boolean[][] wasTree, wasForest;
	boolean[][] memTree, memForest;
	ArrayList<Integer> c;

	boolean canTree(int mask, int leafs) {
		if (wasTree[mask][leafs]) {
			return memTree[mask][leafs];
		}
		wasTree[mask][leafs] = true;
		memTree[mask][leafs] = false;
		if (mask == 0) {
			return memTree[mask][leafs] = (leafs == 1);
		}
		for (int i = 0; i < c.size(); i++) {
			if (((mask >> i) & 1) != 0) {
				if (c.get(i) != Integer.bitCount(mask) + leafs) {
					return memTree[mask][leafs] = false;
				}
				int newMask = mask ^ (1 << i);
				for (int subLeafs = 1; subLeafs < leafs; subLeafs++) {
					int subMask = 0;
					do {
						if (canTree(subMask, subLeafs) && canForest(newMask ^ subMask, leafs - subLeafs)) {
							return memTree[mask][leafs] = true;
						}
						subMask = (subMask - 1) & newMask;
					} while (subMask != 0);
				}
				break;
			}
		}
		return memTree[mask][leafs];
	}

	boolean canForest(int mask, int leafs) {
		if (wasForest[mask][leafs]) {
			return memForest[mask][leafs];
		}
		wasForest[mask][leafs] = true;
		memForest[mask][leafs] = false;
		if (mask == 0) {
			return memForest[mask][leafs] = true;
		}
		int subMask = 0;
		for (int subLeafs = 1; subLeafs <= leafs; subLeafs++) {
			do {
				if (canTree(subMask, subLeafs) && canForest(mask ^ subMask, leafs - subLeafs)) {
					return memForest[mask][leafs] = true;
				}
				subMask = (subMask - 1) & mask;
			} while (subMask != 0);
		}
		return memForest[mask][leafs];
	}

	public void solve() throws IOException {
		int n = in.nextInt();
		c = new ArrayList<>();
		int leafs = 0;
		for (int i = 0; i < n; i++) {
			int x = in.nextInt();
			if (x == 1) {
				leafs++;
			} else {
				c.add(x);
			}
		}
		if (leafs < (n + 1) / 2.0) {
			out.println("NO");
			return;
		}
		Collections.sort(c, Collections.reverseOrder());
		int countProfiles = 1 << c.size();
		wasTree = new boolean[countProfiles][leafs + 1];
		memTree = new boolean[countProfiles][leafs + 1];
		wasForest = new boolean[countProfiles][leafs + 1];
		memForest = new boolean[countProfiles][leafs + 1];
		if (canTree(countProfiles - 1, leafs)) {
			out.println("YES");
		} else {
			out.println("NO");
		}
	}

	public void run() {
		try {
			in = new FastScanner();
			out = new PrintWriter(System.out);

			solve();

			out.close();
		} catch (IOException e) {
			e.printStackTrace();
		}
	}

	class FastScanner {
		BufferedReader br;
		StringTokenizer st;

		FastScanner() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		String next() {
			while (st == null || !st.hasMoreTokens()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}
	}

	public static void main(String[] arg) {
		new C().run();
	}
}