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: 1836kB
Author: 2018212212030
In contest: 1292

#include <iostream>
#include <cstring>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <cmath>
#include <algorithm>
#include <cstdio>
#include <list>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
int i, j, k;
int m, n, p;
int a[10010], b[10010];
int main() {
	int t;
	int flag = 0;
	scanf("%d", &t);
	for (i = 0; i < t; i++) {
		scanf("%d", &a[i]);
	}
	for (i = 0; i < t; i++) {
		if (a[i] == 1) {
			flag = 1;
			break;
		}
	}
	if (flag == 1)
		printf("YES\n");
	else
		printf("NO\n");
	return 0;

}