Codeforces Round #353 (Div. 2) C. Money Transfers

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 a_i ( - 10⁹ ≤ a_i ≤ 10⁹), 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 a_i 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.

题意：给你n个数，总和为0，每次可以把一个值移到它附近，问最少多少次操作能使整个数列值为0.

分析：很显然，最多需要n-1次，如果我们划分出了m个和为零的区间，那么最多需要n-m次。

#include <cstdio>
#include <iostream>
#include <unordered_map>
using namespace std;
unordered_map <long long,long long>f;
long long n,x,now,ans;
int main()
{
	cin.sync_with_stdio(false);
	cin>>n;
	for(int i = 1;i <= n;i++)
	{
		cin>>x;
		now += x;
		ans = max(ans,++f[now]);
	}
	cout<<n-ans<<endl;
}