#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, const U &b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, const U &b) {
  if (a < b) a = b;
}
template <class T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T1, class T2>
inline void gn(T1 &x1, T2 &x2) {
  gn(x1), gn(x2);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
int ans[300010];
int cnt[300010];
int tot;
int n;
int ss[300010];
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    scanf("%1d", ans + i);
    cnt[ans[i]]++;
  }
  tot = n / 3;
  int sum = 0;
  for (int i = 0; i < 3; i++) sum += abs(cnt[i] - tot);
  sum /= 2;
  int s = 0;
  for (int i = 1; i <= n; i++) {
    int first = ans[i];
    for (int j = 0; j <= 2; j++) {
      if (ss[first] < tot and j >= first) continue;
      if (cnt[first] <= tot || cnt[j] >= tot) continue;
      cnt[first]--;
      cnt[j]++;
      ans[i] = j;
      break;
    }
    ss[ans[i]]++;
  }
  for (int i = 1; i <= n; i++) printf("%d", ans[i]);
}
