codeforces 675c Money Transfers

Money Transfers

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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

input

3
5 0 -5

output

1

input

4
-1 0 1 0

output

2

input

4
1 2 3 -6

output

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:

1. transfer 1 from the first bank to the second bank;
2. transfer 3 from the second bank to the third;
3. transfer 6 from the third bank to the fourth.

4. 给定几个数，有正有负，每个数可以向相邻的数转移，问最少的转移次数使得最后所有数均为0。

   分析：

   我们可以将数列化为几个连续的区间，其中每个区间的数和为0，且在区间长度为K的区间中，操作数为K-1，我们就是要最大化这样的区间个数。可以维护一个前缀和，这样两个相同的前缀之间的区间和即为0。

   
   

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<set>
#include<map>
#include<queue>
#include<algorithm>
using namespace std;
int main(){
	map<long long ,int>mp;
	int a[100005];
	int n;
	long long sum=0;
	int ans=1;
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d",&a[i]);
	}
	mp[0]=1;
	for(int i=1;i<n;i++){
		sum+=a[i];
		mp[sum]++;
		if(ans<=mp[sum])
			ans=mp[sum];
	}
	printf("%d\n",n-ans);
    return 0;
}