#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ll n;cin>>n;
ll m=2*n,counter=0,maxc=0;
ll arr[m],brr[m]={0};for(ll i=0;i<m;i++)cin>>arr[i];
for(ll i=0; i<m; i++){
if(brr[arr[i]]==0){
brr[arr[i]]++;
counter++;
if(counter>maxc)
maxc=counter;
}
else{
brr[arr[i]]--;
counter--;
}
}
cout << maxc << endl;
return 0;
}
1566B - MIN-MEX Cut | 678C - Joty and Chocolate |
1352E - Special Elements | 1520E - Arranging The Sheep |
1157E - Minimum Array | 1661D - Progressions Covering |
262A - Roma and Lucky Numbers | 1634B - Fortune Telling |
1358A - Park Lighting | 253C - Text Editor |
365B - The Fibonacci Segment | 75A - Life Without Zeros |
1519A - Red and Blue Beans | 466A - Cheap Travel |
659E - New Reform | 1385B - Restore the Permutation by Merger |
706A - Beru-taxi | 686A - Free Ice Cream |
1358D - The Best Vacation | 1620B - Triangles on a Rectangle |
999C - Alphabetic Removals | 1634C - OKEA |
1368C - Even Picture | 1505F - Math |
1473A - Replacing Elements | 959A - Mahmoud and Ehab and the even-odd game |
78B - Easter Eggs | 1455B - Jumps |
1225C - p-binary | 1525D - Armchairs |