#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 998244353
#define sz(x) ((int)((x).size()))
// #define int ll
// #define N 
using namespace std;
int n,f[2][2],g[4][4];
map<pa,int>Mp;
void ers(int x,int y)
{
    Mp.erase({x,y});
    f[x%2][y%2]--;
    g[x%4][y%4]--;
}
void ins(int x,int y)
{
    Mp[{x,y}]=1;
    f[x%2][y%2]++;
    g[x%4][y%4]++;
}
void BellaKira()
{
    cin>>n;
    for (int i=1;i<=n;i++)
    {
        int x,y;
        cin>>x>>y;
        // cerr<<"wtf"<<endl;
        if (Mp.count({x,y})) ers(x,y);
        else ins(x,y);
        // cerr<<"wtf"<<endl;

        int ans=0;
        for (int i=0;i<2;i++)
            for (int j=0;j<2;j++) ans=max(ans,f[i][j]);
        for (int i=0;i<4;i++)
            for (int j=0;j<4;j++) 
                ans=max(ans,g[i][j]+g[(i+2)%4][j]+g[(i+1)%4][(j+2)%4]+g[(i+3)%4][(j+2)%4]);

        for (int i=0;i<4;i++)
            for (int j=0;j<4;j++) 
                ans=max(ans,g[i][j]+g[(i+2)%4][(j+1)%4]+g[i][(j+2)%4]+g[(i+2)%4][(j+3)%4]);
        cout<<ans<<'\n';
    }
}
signed main()
{
	IOS;
	cin.tie(0);
	int T=1;
	while (T--)
	{
		BellaKira();
	}
}