Start: Jul, 03, 2019 08:38:00
2019年度暑期短学期第七天 助教场
End: Jul, 04, 2019 23:00:00
Time elapsed:
Time remaining:

Problem_ID: A
Result: Accepted
Time: 3ms
Memory: 1756kB
Author: 2017212212237
In contest: 1292

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#define INF 0x3f3f3f3f
#define lowbit(x) (x&(-x))
using namespace std;
typedef long long ll;

const int maxn = 1e6 + 10;

int main()
{
    int n;
    scanf("%d",&n);
    int flag = 0;
    while(n--)
    {
        int x;
        scanf("%d",&x);
        if(x == 1)
            flag = 1;
    }
    if(flag)
        puts("YES");
    else 
        puts("NO");
}