#include<bits/stdc++.h>

 #define LL long long

 using namespace std;

 bool vis[];

 int ans,tot,a[],n;

 int main()

 {

     scanf("%d",&n);

     for (int i=; i<=*n; i++)

     {

         int x; scanf("%d",&x);

         if (!vis[x]) tot++,vis[x]=; else tot--;

         ans=max(ans,tot);

     }

     cout<<ans;

 } 

 #include<bits/stdc++.h>

 #define LL long long

 #define eps 1e-8

 using namespace std;

 int n,x[],v[];

 double get_dis(double pos)

 {

     double t=;

     for (int i=; i<=n; i++)

         t=max(t,fabs((double)pos-x[i])/(double)v[i]);

     return t;

 }

 int main()

 {

     scanf("%d",&n);

     for (int i=; i<=n; i++) scanf("%d",&x[i]);

     for (int i=; i<=n; i++) scanf("%d",&v[i]);

     double l=,r=1e9; int tot=;

     double mid1,mid2;

     while (r-l>eps)

     {

         mid1=(r-l)/+l,mid2=(r-l)/*+l;

         if (get_dis(mid1)-get_dis(mid2)>eps) l=mid1;

             else r=mid2;

         if (++tot>) break;

     }

     printf("%.10lf",get_dis(mid1));

     return ;

 }

 #include<bits/stdc++.h>

 #define LL long long

 #define N 100005

 #define eps 1e-8

 using namespace std;

 int pos,n,col[N<<],mx;

 struct edge{

     int to,next;

 }e[N<<];

 int head[N<<],cnt;

 void insert(int x, int y)

 {

     e[++cnt].to=y; e[cnt].next=head[x]; head[x]=cnt;

 }

 void dfs(int x, int fa)

 {

     int size=;

     for (int i=head[x];i;i=e[i].next)

     {

         if (e[i].to==fa) continue;

         size++;

         dfs(e[i].to,x);

     }

     if (x==)

     {

         if (size+>mx) mx=size+,pos=x;

     }

     else if (size+>mx) mx=size+,pos=x;

 }

 void solve_paint(int x, int fa)

 {

     int orz=;

     for (int i=head[x];i;i=e[i].next)

     {

         while (orz==col[x] || orz==col[fa]) orz++;

         if (e[i].to==fa) continue;

         col[e[i].to]=orz; orz++;

         solve_paint(e[i].to,x);

     }

 }

 int main()

 {

     scanf("%d",&n);

     for (int i=; i<n; i++)

     {

         int x,y; scanf("%d%d",&x,&y);

         insert(x,y);

         insert(y,x);

     }

     dfs(,);

     cout<<mx<<endl;

     col[pos]=;

     solve_paint(pos,);

     for (int i=; i<=n; i++)

         printf("%d ",col[i]);

     return ;

 }