C. Mike and gcd problem

C. Mike and gcd problem

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Mike has a sequence A = [a1, a2, ..., an] of length n. He considers the sequence B = [b1, b2, ..., bn] beautiful if the gcd of all its elements is bigger than 1, i.e. .

Mike wants to change his sequence in order to make it beautiful. In one move he can choose an index i (1 ≤ i < n), delete numbers ai, ai + 1 and put numbers ai - ai + 1, ai + ai + 1 in their place instead, in this order. He wants perform as few operations as possible. Find the minimal number of operations to make sequence A beautiful if it's possible, or tell him that it is impossible to do so.

 is the biggest non-negative number d such that d divides bi for every i (1 ≤ i ≤ n).

Input

The first line contains a single integer n (2 ≤ n ≤ 100 000) — length of sequence A.

The second line contains n space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 109) — elements of sequence A.

Output

Output on the first line "YES" (without quotes) if it is possible to make sequence A beautiful by performing operations described above, and "NO" (without quotes) otherwise.

If the answer was "YES", output the minimal number of moves needed to make sequence A beautiful.

Examples

input

2
1 1

output

YES
1

input

3
6 2 4

output

YES
0

input

2
1 3

output

YES
1

Note

In the first example you can simply make one move to obtain sequence [0, 2] with .

In the second example the gcd of the sequence is already greater than 1.

。。。。这个题仔细想想是真的不难，想当然以为是个数论的题了QAQ，光往难得想，其实仔细想想：

开始验证一下整个序列的gcd是不是大于1，是OK，YES 0 ；

如果不是，仔细想想，我们的这种操作有什么特殊的，

加减影响的其实就是后面的奇偶性。

对于序列中的一个奇数，如果后面也是奇数，那么操作一次这两个数就都变成偶数了。

如果后面的是偶数，那么操作一次之后两个数都变成奇数了，然后再操作一次就可以了。

所以，仔细写写看看就会发现了。QAQ

#include <bits/stdc++.h>

using namespace std;
const int MAXN=1e5+7;
int n;
int num[MAXN];
int main()
{
    scanf("%d",&n);
    scanf("%d",&num[0]);
    int g=num[0];
    for(int i=1; i<n; ++i)
    {
        scanf("%d",&num[i]);
        g=__gcd(num[i],g);
    }
    puts("YES");
    if(g>1)puts("0");
    else
    {
        int ans=0;
        for(int i=0;i<n;++i)
        {
            while(num[i]%2)
            {
                int t1=num[i],t2=num[i+1];
                num[i]=abs(t1-t2);
                num[i+1]=t1+t2;
                ans++;
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}