Codeforces 782 Andryusha and Socks

Andryusha is an orderly boy and likes to keep things in their place.

Today he faced a problem to put his socks in the wardrobe. He has n distinct pairs of socks which are initially in a bag. The pairs are numbered from 1 to n. Andryusha wants to put paired socks together and put them in the wardrobe. He takes the socks one by one from the bag, and for each sock he looks whether the pair of this sock has been already took out of the bag, or not. If not (that means the pair of this sock is still in the bag), he puts the current socks on the table in front of him. Otherwise, he puts both socks from the pair to the wardrobe.

Andryusha remembers the order in which he took the socks from the bag. Can you tell him what is the maximum number of socks that were on the table at the same time?

Input

The first line contains the single integer n (1 ≤ n ≤ 10⁵) — the number of sock pairs.

The second line contains 2n integers x₁, x₂, ..., x_2n (1 ≤ x_i ≤ n), which describe the order in which Andryusha took the socks from the bag. More precisely, x_i means that the i-th sock Andryusha took out was from pair x_i.

It is guaranteed that Andryusha took exactly two socks of each pair.

Output

Print single integer — the maximum number of socks that were on the table at the same time.

Example

Input

1
1 1

Output

1

Input

3
2 1 1 3 2 3

Output

2

Note

In the first example Andryusha took a sock from the first pair and put it on the table. Then he took the next sock which is from the first pair as well, so he immediately puts both socks to the wardrobe. Thus, at most one sock was on the table at the same time.

In the second example Andryusha behaved as follows:

• Initially the table was empty, he took out a sock from pair 2 and put it on the table.
• Sock (2) was on the table. Andryusha took out a sock from pair 1 and put it on the table.
• Socks (1, 2) were on the table. Andryusha took out a sock from pair 1, and put this pair into the wardrobe.
• Sock (2) was on the table. Andryusha took out a sock from pair 3 and put it on the table.
• Socks (2, 3) were on the table. Andryusha took out a sock from pair 2, and put this pair into the wardrobe.
• Sock (3) was on the table. Andryusha took out a sock from pair 3 and put this pair into the wardrobe.

Thus, at most two socks were on the table at the same time.

题目大意：一个人有点强迫症，一堆排列的袜子，依次放入桌子上，如果桌子上有两只同样的袜子凑成一双的时候，就把这些袜子放入书包里，问，桌子上最多有几只袜子。

题目分析：用一个变量mx记录当前桌子上的袜子数量，a数组记录编号为b的袜子有几只，如果有两只则拿走，mx减一，否则加一，ans取mx的最大值，最后输出ans即可。

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 100050;
int a[maxn];
int main(){
	int n;
	while((scanf("%d",&n))!=EOF){
		int mx=0;
		int ans=0;
		memset(a,0,sizeof(a));
		for(int i=1;i<=2*n;i++){
		    int b;
			scanf("%d",&b);
			a[b]++;
			if(a[b]==2)
			  mx--;
			else mx++;
			ans=max(ans,mx);
		}
		printf("%d\n",ans);
	}
	return 0;
}