#include <bits/stdc++.h>   using namespace std;   bool used[10000005];   int ans[105];   bool comp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) {     if (a.first.second == b.first.second) return a.first.first < b.first.first;     return a.first.second < b.first.second;   }   void solve() {     int N;     cin >> N;     vector<pair<pair<int, int>, int>> x(N);     for (int i = 0; i < N; i++) {       cin >> x[i].first.first >> x[i].first.second;       x[i].second = i;     }     sort(x.begin(), x.end(), comp);     for (int i = 0; i < N; i++) {       for (int j = x[i].first.first; j < x[i].first.second + 1; j++) {         if (!used[j]) {           used[j] = true;           ans[x[i].second] = j;           break;         }       }     }     for (int i = 0; i < N; i++) {       cout << ans[i] <<    ;     }   }   int main() {     ios_base::sync_with_stdio(false);     cin.tie(0);     cout.tie(0);     int t = 1;     while (t--) {       solve();     }     return 0;   }   