#include <algorithm>
#include <iostream>
using namespace std;
const int K = 250000;
const int N = 2500;
int ii[K], jj[K], aa[N][N], pp[N][N], qq[N][N], ii_[N], jj_[N], xx[N][N], yy[N][N];
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL);
int k; cin >> k;
for (int h = 0; h < k; h++) {
int i, j; cin >> i >> j, i--, j--;
ii[h] = i, jj[h] = j;
aa[i][j] = pp[i][j] = qq[i][j] = 1;
}
for (int i = 1; i < N; i++)
for (int j = 0; j < N; j++)
pp[i][j] += pp[i - 1][j];
for (int i = 0; i < N; i++)
for (int j = N - 2; j >= 0; j--)
pp[i][j] += pp[i][j + 1];
for (int i = N - 2; i >= 0; i--)
for (int j = 0; j < N; j++)
qq[i][j] += qq[i + 1][j];
for (int i = 0; i < N; i++)
for (int j = 1; j < N; j++)
qq[i][j] += qq[i][j - 1];
for (int j = 0; j < N; j++) {
int i_ = j ? ii_[j - 1] : N;
for (int i = 0; i < N; i++)
if (aa[i][j])
i_ = min(i_, i);
ii_[j] = i_;
}
for (int i = N - 1; i >= 0; i--) {
int j_ = i + 1 < N ? jj_[i + 1] : -1;
for (int j = 0; j < N; j++)
if (aa[i][j])
j_ = max(j_, j);
jj_[i] = j_;
}
for (int i = 0; i < N; i++)
for (int j = N - 1; j >= 0; j--)
if (pp[i][j]) {
int i_ = j ? min(ii_[j - 1], i) : i;
int j_ = i + 1 < N ? max(jj_[i + 1], j) : j;
xx[i][j] = pp[i][j] + xx[i_][j_];
}
for (int j = N - 1; j >= 0; j--) {
int i_ = j + 1 < N ? ii_[j + 1] : -1;
for (int i = 0; i < N; i++)
if (aa[i][j])
i_ = max(i_, i);
ii_[j] = i_;
}
for (int i = 0; i < N; i++) {
int j_ = i ? jj_[i - 1] : N;
for (int j = 0; j < N; j++)
if (aa[i][j])
j_ = min(j_, j);
jj_[i] = j_;
}
for (int i = N - 1; i >= 0; i--)
for (int j = 0; j < N; j++)
if (qq[i][j]) {
int i_ = j + 1 < N ? max(ii_[j + 1], i) : i;
int j_ = i ? min(jj_[i - 1], j) : j;
yy[i][j] = qq[i][j] + yy[i_][j_];
}
for (int h = 0; h < k; h++) {
int i = ii[h], j = jj[h];
cout << xx[i][j] + yy[i][j] + k - 3 << '\n';
}
return 0;
}
