CF691A.Fashion in Berland

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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.

输入格式

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

输出格式

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

输入输出样例

输入#1
```
3
1 0 1
```
输出#1
```
YES
```
输入#2
```
3
1 0 0
```
输出#2
```
NO
```

首页