CF782A 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.

Examples

input

1
1 1

output

1

input

3
2 1 1 3 2 3

output

2

思路：

水题不解释。

实现：

#include <cstdio>
#include <iostream>
using namespace std;
int cnt[100005], tmp, n;
int main()
{
    cin >> n;
    int all = 0;
    int maxn = -1;
    for (int i = 0; i < 2 * n; i++)
    {
        cin >> tmp;
        cnt[tmp]++;
        if (cnt[tmp] == 2)
            all--;
        else
            all++;
        if (maxn < all)
            maxn = all;
    }
    cout << maxn << endl;
    return 0;
}