#include <bits/stdc++.h>
using namespace std;
#define BIT(n) (1LL << (n))
#define BITF(n, i) (((n) >> (i)) & 1)
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPI(i, x) for (int i = 1; i <= x; i++)
#define FORI(i, m, n) for (int i = m; i <= n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define REPZ(i, x) for (int i = 0; i <= x; i++)
#define FORA(i, n) for (auto &&i : n)
#define POW(a, b) ((int)(pow(a, b) + .5))
#define MODULO(a, b) (((a) % (b)) < 0 ? (a) % (b) + (b) : (a) % (b))
#define DUMPOUT cerr
// vector
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
  for (T &x : vec) is >> x;
  return is;
}
// pair
template <typename T, typename U> ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
  os << "(" << pair_var.first << ", " << pair_var.second << ")";
  return os;
}
// vector
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
  os << "{";
  REP(i, (int)vec.size())
  os << vec[i] << (i + 1 == (int)vec.size() ? "" : ", ");
  os << "}";
  return os;
}
// map
template <typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &map_var) {
  os << "{";
  FORA(itr, map_var) {
    os << *itr;
    itr++;
    if (itr != map_var.end()) os << ", ";
    itr--;
  }
  os << "}";
  return os;
}
// set
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) {
  os << "{";
  FORA(itr, set_var) {
    os << *itr;
    itr++;
    if (itr != set_var.end()) os << ", ";
    itr--;
  }
  os << "}";
  return os;
}
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) {
  DUMPOUT << head;
  if (sizeof...(Tail) > 0) DUMPOUT << ", ";
  dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define DUMP(...)                                                             \
  DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                             \
          << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
          << "    ",                                                          \
      dump_func(__VA_ARGS__)
#define PRINTARR(x, y)                                     \
  cerr << #x << "=\n";                                     \
  for (auto itr = x; itr != y; itr++) cerr << *itr << " "; \
  cerr << endl;
#define PRINTARR2(x, i0, i1)                                       \
  cerr << #x << "=\n";                                             \
  for (int ii0 = 0; ii0 < i0; ii0++) {                             \
    for (int ii1 = 0; ii1 < i1; ii1++) cerr << x[ii0][ii1] << " "; \
    cerr << endl;                                                  \
  }
#else
#define DEB if (false)
#define DUMP(...)
#define PRINTARR(x, y)
#define PRINTARR2(x, i0, i1)
#endif
#define ALL(v) v.begin(), v.end()
#define fst first
#define snd second
#define mp make_pair
#define pb push_back
#define epb emplace_back
#define int long long
#define pint pair<int, int>
#define pdouble pair<double, double>
#define ld long double
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> using vec = std::vector<T>;
template <class T> void print(const T &x) { cout << x << "\n"; }
const int MOD = 1000000007, INF0 = 1061109567, INF = INF0 * INF0;
const double EPS = 1e-7, PI = acos(-1.0);
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
/*  set UnionFind BIT deque queue multiset segtree priority_queue bitset map vector
[&] { return; }();下のスラッシュを2つ追加しただけ.上のスラッシュを2つにすれば外れる.
//*/
#define MAXN 200100
vec<int> G[MAXN];
int d[MAXN];
int num[MAXN];
int cnt0, cnt1, cnt2;
void dfs(int id, int parent, int cnt) {
  d[id] = cnt;
  FORA(e, G[id]) {
    if (e != parent) {
      dfs(e, id, cnt + 1);
    }
  }
}
signed main() {
  cin.tie(0), ios::sync_with_stdio(false);
  cout << fixed << setprecision(12);
  int N;
  cin >> N;
  REP(i, N - 1) {
    int p, q;
    cin >> p >> q;
    p--, q--;
    G[p].pb(q);
    G[q].pb(p);
  }
  int v0 = N / 3;
  int v1 = N / 3 + (1 <= N % 3);
  int v2 = N / 3 + (2 <= N % 3);
  DUMP(v0, v1, v2);
  assert(v0 + v1 + v2 == N);
  dfs(0, -1, 0);

  int valE = 0;
  REP(i, N) { valE += (d[i] % 2 == 0); }
  int valO = N - valE;
  DUMP(valO, valE, v0 + v1);
  int tval = 0;
  if (valO > valE) {  //多い
    tval = 1;
  }
  if (max(valE, valO) > v0 + v1) {
    REP(i, N) {
      if (d[i] % 2 == tval) {
        if (cnt1 < v1) {
          num[i] = 1 + cnt1 * 3;
          cnt1++;
        } else if (cnt2 < v2) {
          num[i] = 2 + cnt2 * 3;
          cnt2++;
        } else {
          num[i] = 3 + cnt0 * 3;
          cnt0++;
        }
      } else {
        num[i] = 3 + cnt0 * 3;
        cnt0++;
      }
    }
  } else {
    REP(i, N) {
      if (d[i] % 2 == tval) {
        if (cnt1 < v1) {
          num[i] = 1 + cnt1 * 3;
          cnt1++;
        } else {
          num[i] = 3 + cnt0 * 3;
          cnt0++;
        }
      } else {
        if (cnt2 < v2) {
          num[i] = 2 + cnt2 * 3;
          cnt2++;
        } else {
          num[i] = 3 + cnt0 * 3;
          cnt0++;
        }
      }
    }
  }
  REP(i, N) { cout << (i ? " " : "") << num[i]; }
  cout << "\n";
}

Measured memory_bytes: 20608