CF #403 Div.2 A

最新推荐文章于 2023-01-28 20:01:07 发布

原创最新推荐文章于 2023-01-28 20:01:07 发布 · 284 阅读

0 ·

CC 4.0 BY-SA版权

contest 专栏收录该内容

18 篇文章

订阅专栏

本文探讨了一个有趣的算法问题：有序男孩安德留沙如何将成对的袜子整理放入衣柜，并在此过程中确保桌面袜子数量的最大值。通过分析输入顺序及配对规则，实现了对最大桌面袜子数的有效计算。

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 from1 ton. 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 thei-th sock Andryusha took out was from pairx_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.

Examples

Input

1
1 1

Output

Input

3
2 1 1 3 2 3

Output

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 pair1 and put it on the table.
Socks (1, 2) were on the table. Andryusha took out a sock from pair1, and put this pair into the wardrobe.
Sock (2) was on the table. Andryusha took out a sock from pair3 and put it on the table.
Socks (2, 3) were on the table. Andryusha took out a sock from pair2, and put this pair into the wardrobe.
Sock (3) was on the table. Andryusha took out a sock from pair3 and put this pair into the wardrobe.

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

#include<iostream>
#include<cstdio>
#include<string.h>
#include<algorithm>
#define LL long long 
#define MAX 200010
using namespace std;

int a[MAX];
int main()
{
	
	int n;
	scanf("%d",&n);
	for(int i=1;i<=2*n;i++)
		a[i]=2;
	int tab=0;
	int ans=0;
	for(int i=1;i<=2*n;i++)
	{
		int c;
		scanf("%d",&c);
		a[c]-=1;
		if(a[c]==1)
		{
			tab++;
			ans=max(ans,tab);
		}
		else
		{
			tab--;
		}
	} 
	printf("%d\n",ans);
	
}