// compile: make data
// run: ./data < data.in
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#ifdef LOCAL
#include <debug/codeforces.h>
#define debug(x...) _debug_print(#x, x);
#define Debug(x...) _debug_print_format(#x, x);
std::ifstream terminal("/dev/tty");
#define PP cerr<<"\033[1;30mpause...\e[0m",terminal.ignore();
#else
#define debug(x...)
#define Debug(x...)
#define PP
#endif
template<typename...Args> void print_(Args...args){((cout<<args<<" "),...)<<endl;}
#define rep(i,a,b) for(int i=(a);i<(int)(b);++i)
#define sz(v) ((int)(v).size())
#define print(...) print_(__VA_ARGS__);
#define FIND(a, x) ((find(a.begin(),a.end(),(x))!=a.end())?1:0)
#define cmin(x,...) x=min({(x),__VA_ARGS__})
#define cmax(x,...) x=max({(x),__VA_ARGS__})
#define INTMAX (int)(9223372036854775807)
#define INF (int)(1152921504606846976)
#define NaN (int)(0x8b88e1d0595d51d1)
#define double long double
#define int long long
#define uint unsigned long long
#define MAXN 200010

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

    tree<pair<int, int>, null_type, decltype([](pair<int, int> A, pair<int, int> B) {return (A.second < B.second) || (A.second == B.second && A.first < B.first); }), rb_tree_tag, tree_order_statistics_node_update> s1, s2;
    int n; cin >> n;
    vector<pair<pair<int, int>, int>> a(n);
    rep(i, 0, n) {
        cin >> a[i].first.first >> a[i].first.second;
        a[i].second = i;
        s1.insert({a[i].first.first, a[i].first.second});
    }
    sort(a.begin(), a.end());
    vector<int> res1(n), res2(n);
    for (int pre = 0, i = 0; i < n; ++i) {
        res1[a[i].second] = s1.order_of_key({INF, a[i].first.second}) - 1;
        if (i == n-1 || a[i].first.first == a[i+1].first.first) continue;
        rep(j, pre, i+1) s1.erase({a[j].first.first, a[j].first.second});
        pre = i+1;
    }
    for (int lst = 0, i = 0; i < n; ++i) {
        if (i >= lst) {
            s2.insert({a[i].first.first, a[i].first.second});
            for (++lst; (lst < n) && (a[lst].first.first == a[lst-1].first.first); ++lst) s2.insert({a[lst].first.first, a[lst].first.second});
        }
        res2[a[i].second] = sz(s2) - s2.order_of_key({-INF, a[i].first.second}) - 1;
    }
    rep(i, 0, n) printf("%lld%c", res1[i], " \n"[i==n-1]);
    rep(i, 0, n) printf("%lld%c", res2[i], " \n"[i==n-1]);

    return 0;
}