H-Fashion in Berland

#include <bits/stdc++.h>

using namespace std;
int a[1005];
int main()
{
    int n;
    scanf("%d",&n);
    int sum = 0;
    int flag;
    for(int i = 0; i < n; i ++)
    {
        scanf("%d",&a[i]);
        if(a[i]==0){
            sum ++;
        }
    }
    if(n == 1)
    {
        if(a[0] == 1)
        {
            flag = 1;
        }
        else
        {
            flag = 0;
        }
    }
    else
    {
        if(sum==1)
        {
            flag = 1;
        }
        else
        {
            flag = 0;
        }
    }
    if(flag)
        printf("YES\n");
    else
        printf("NO\n");
    return 0;
}

题目描述：

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

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".

Example

Input

3 1 0 1

Output

YES

Input

3 1 0 0

Output

NO