// compile: make data
// run: ./data < data.in
#include <bits/stdc++.h>
using namespace std;
#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);

    int n; cin >> n;
    struct node {
        int l, r, id;
    };
    vector<node> f(n);
    rep(i, 0, n) {
        int x, y; cin >> x >> y;
        f[i] = {x, y, i};
    }
    sort(f.begin(), f.end(), [](node a, node b) {return a.l < b.l || (a.l == b.l && a.r < b.r);});
    debug(f)
    set<node, function<bool(node, node)>> s([](node a, node b) {return a.r > b.r || (a.r == b.r && a.l > b.l) || (a.r == b.r && a.l == b.l && a.id < b.id); });
    vector<int> res(n);
    int cnt = 0;
    rep(i, 0, n) {
        auto it = s.lower_bound({-INF, f[i].l, 0});
        if (it == s.end()) {
            s.insert({f[i].l, f[i].r, cnt});
            // debug(f[i].l, f[i].r, cnt)
            res[f[i].id] = cnt;
            ++cnt;
        }
        else {
            int id = it->id;
            s.erase(it);
            s.insert({f[i].l, f[i].r, id});
            res[f[i].id] = id;
        }
        debug(s, cnt)
    }
    cout << cnt << endl;
    rep(i, 0, n) cout << res[i] + 1 << " \n"[i==n-1];

    return 0;
}