Henu ACM Round#21 C. Fashion in Berland

点我啊，我是链接
点我也行
C. Fashion in Berland

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

According to rules of the Berland fashion, a jacket should be fastened by all the buttons except only one, but not necessarily it should be the last one. Also if the jacket has only one button, it should be fastened, so the jacket will not swinging open.

You are given a jacket with n buttons. Determine if it is fastened in a right way.

Input

The first line contains integer n (1 ≤ n ≤ 1000) — the number of buttons on the jacket.

The second line contains n integers a_i (0 ≤ a_i ≤ 1). The number a_i = 0 if the i-th button is not fastened. Otherwise a_i = 1.

Output

In the only line print the word "YES" if the jacket is fastened in a right way. Otherwise print the word "NO".

Examples

input

3
1 0 1

output

YES

input

3
1 0 0

output

NO

题意：给一串0和1，当只有一个0，输出"YES"，否则输出"NO"；当只有一个数时，是1时，输出"YES"，否则输出"NO"


解法：统计0的个数，判断


代码：

import java.util.Scanner;

public class Main2 {

	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int n;
		while (scanner.hasNext()) {
			n = scanner.nextInt();
			int ans = 0;
			for (int i = 0; i < n; i++) {
				int x = scanner.nextInt();
				if (x == 0)
					ans++;
			}
			if ((ans == 1 && n != 1) || (ans == 0 && n == 1))
				System.out.println("YES");
			else
				System.out.println("NO");
		}
	}
}