#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a,b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a,b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
refs:
edi
*/
const int MOD = 1e9 + 7;
const int N = 2500 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
int here[N][N], p[N][N], mni[N][N], mxi[N][N], mnj[N][N], mxj[N][N], dp1[N][N], dp2[N][N];
void solve(int test_case)
{
int n; cin >> n;
vector<pii> a(n+5);
rep1(i,n) cin >> a[i].ff >> a[i].ss;
memset(mni,0x3f,sizeof mni);
memset(mnj,0x3f,sizeof mnj);
memset(mxi,-0x3f,sizeof mxi);
memset(mxj,-0x3f,sizeof mxj);
rep1(i,n) here[a[i].ff][a[i].ss] = 1;
rep1(i,N-2){
rep1(j,N-2){
p[i][j] = p[i-1][j]+p[i][j-1]-p[i-1][j-1]+here[i][j];
}
}
rep1(i,N-2){
rep1(j,N-2){
mni[i][j] = min(mni[i-1][j],mni[i][j-1]);
mnj[i][j] = min(mnj[i-1][j],mnj[i][j-1]);
if(here[i][j]){
amin(mni[i][j],i);
amin(mnj[i][j],j);
}
}
}
rev(i,N-2,1){
rev(j,N-2,1){
mxi[i][j] = max(mxi[i+1][j],mxi[i][j+1]);
mxj[i][j] = max(mxj[i+1][j],mxj[i][j+1]);
if(here[i][j]){
amax(mxi[i][j],i);
amax(mxj[i][j],j);
}
}
}
auto f = [&](int r1, int r2, int c1, int c2){
return p[r2][c2]-p[r1-1][c2]-p[r2][c1-1]+p[r1-1][c1-1];
};
// top-right rect
rep1(i,N-2){
rev(j,N-2,1){
dp1[i][j] = f(1,i,j,N-2);
if(!dp1[i][j]) conts;
int r = mni[i][j-1], c = mxj[i+1][j];
amin(r,i);
amax(c,j);
if(r >= 1 and r <= N-2 and c >= 1 and c <= N-2){
dp1[i][j] += dp1[r][c];
}
}
}
// bottom-left rect
rev(i,N-2,1){
rep1(j,N-2){
dp2[i][j] = f(i,N-2,1,j);
int r = mxi[i][j+1], c = mnj[i-1][j];
amax(r,i);
amin(c,j);
if(r >= 1 and r <= N-2 and c >= 1 and c <= N-2){
dp2[i][j] += dp2[r][c];
}
}
}
rep1(i,n){
auto [r,c] = a[i];
int ans = n-1+dp1[r][c]-1+dp2[r][c]-1;
cout << ans << endl;
}
}
int main()
{
fastio;
int t = 1;
// cin >> t;
rep1(i, t) {
solve(i);
}
return 0;
}
