#include <bits/stdc++.h>   using namespace std;   pair<int, int> a[300000 + 13];   int n;   void erf() {     for (int i = 1; i < n; i++) {       if (a[i - 1].first + 1 >= a[i].first) a[i].first = a[i - 1].first + 1;     }   }   int main() {     int cur, ebte;     cin >> n;     for (int i = 0; i < n; i++) {       cin >> a[i].first;       a[i].second = i;     }     sort(a, a + n);     erf();     pair<int, int> b;     for (int i = 0; i < n; i++) {       b = make_pair(a[i].second, a[i].first);       swap(a[i], b);     }     sort(a, a + n);     for (int i = 0; i < n; i++) {       cout << a[i].second <<    ;     }     cout << endl;   }   