include

include

define ll long long

include

include

include

include

using namespace std;

include

bool compareBy(const pair<ll,pair<ll,int> >&a,const pair<ll ,pair<ll,int> >&b){ if(a.second.first!=b.second.first) return a.second.first<b.second.first;

return a.first<b.first;

} void solve(){ ll int n; cin>>n; vector<pair<ll,pair<ll,int> > >a;

for(int i=0;i<n;i++){ ll x,y; cin>>x>>y; a.push_back({x,{y,i}}); }

sort(a.begin(),a.end(),compareBy);

int res[n]={},valAssigned=1;

res[a[0].second.second]=valAssigned;

priority_queue<pair<int,int> ,vector<pair<int,int> >,greater<pair<int,int> > >pq;
pq.push({a[0].second.first,1});     //storing the finish time of room with the room number 

for(int i=1;i<n;i++){
    if(a[i].first>pq.top().first){
       auto temp=pq.top().second;
       pq.pop();
       res[a[i].second.second]=temp;
       pq.push({a[i].second.first,temp});
    }
    else{
       res[a[i].second.second]=++valAssigned;
       pq.push({a[i].second.first,valAssigned});
    }

}
cout<<valAssigned<<"\n";
for(int i=0;i<n;i++)
cout<<res[i]<<" ";
cout<<endl;

}

int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t=1; // cin>>t; while(t--){ solve(); } }