Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
A. Fashion in Berland

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputAccording 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

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jan/31/2023 09:01:04 (i2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|