There are n banks in the city where Vasya lives, they are located in a circle, such that any two banks are neighbouring if their indices differ by no more than 1. Also, bank 1 and bank n are neighbours if n > 1. No bank is a neighbour of itself.
Vasya has an account in each bank. Its balance may be negative, meaning Vasya owes some money to this bank.
There is only one type of operations available: transfer some amount of money from any bank to account in any neighbouring bank. There are no restrictions on the size of the sum being transferred or balance requirements to perform this operation.
Vasya doesn’t like to deal with large numbers, so he asks you to determine the minimum number of operations required to change the balance of each bank account to zero. It’s guaranteed, that this is possible to achieve, that is, the total balance of Vasya in all banks is equal to zero.
Input
The first line of the input contains a single integer n (1 ≤ n ≤ 100 000) — the number of banks.
The second line contains n integers ai ( - 109 ≤ ai ≤ 109), the i-th of them is equal to the initial balance of the account in the i-th bank. It’s guaranteed that the sum of all ai is equal to 0.
Output
Print the minimum number of operations required to change balance in each bank to zero.
Examples
inputCopy
3
5 0 -5
outputCopy
1
inputCopy
4
-1 0 1 0
outputCopy
2
inputCopy
4
1 2 3 -6
outputCopy
3
Note
In the first sample, Vasya may transfer 5 from the first bank to the third.
In the second sample, Vasya may first transfer 1 from the third bank to the second, and then 1 from the second to the first.
In the third sample, the following sequence provides the optimal answer:
transfer 1 from the first bank to the second bank;
transfer 3 from the second bank to the third;
transfer 6 from the third bank to the fourth.
合并相邻两堆，问最少几次操作可以使所有的都变成0 ；
思路：在长度为 len 的连续元素中，如果其sum==0,那么操作次数就是 len-1;
所以我们要找到最多数量 sum=0 的序列，不妨设其个数为k，那么如何求解？
考虑一个前缀和，统计出现数量最多的前缀和，那么这个就是k。那么总和就是 n-k;
题目求解完成：
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 0x3f3f3f3f
#define maxn 200005
const int mod=1e9+7;
#define eps 1e-6
#define pi acos(-1.0)
ll quickpow(ll a,ll b,ll m)
{
ll ans=1;
while(b){
if(b&1){
ans=ans*a%m;
}
a=a*a%m;
b>>=1;
}
return ans;
}
ll gcd(ll a,ll b)
{
return b==0?a:gcd(b,a%b);
}
map<ll,ll>mp;
ll a[maxn];
int main()
{
ios::sync_with_stdio(false);
int n;
cin>>n;
ll s=0;
ll ans=0;
for(int i=0;i<n;i++){
cin>>a[i];
s+=a[i];
ans=max(ans,++mp[s]);
}
cout<<n-ans<<endl;
}