#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef tuple<int,int,int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
inline int getInt() { int x; scanf("%d",&x); return x;}
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const v(T)&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
const int MX = 200005;

vi to[MX];
int c[MX];
void dfs(int v, int col=0, int p=-1) {
  c[v] = col;
  for (int u : to[v]) {
    if (u == p) continue;
    dfs(u,col^1,v);
  }
}

int main() {
  int n;
  scanf("%d",&n);
  rep(i,n-1) {
    int a,b;
    scanf("%d%d",&a,&b);
    --a; --b;
    to[a].pb(b);
    to[b].pb(a);
  }
  dfs(0);
  vi s, t;
  rep(i,n) if (c[i]) s.pb(i); else t.pb(i);
  if (sz(s) < sz(t)) swap(s,t);
  vvi x(3);
  rrep(i,n) x[i%3].pb(i);
  vi ans(n);
  if (sz(t) <= sz(x[0])) {
    for (int v : t) {
      ans[v] = x[0].back();
      x[0].pop_back();
    }
    for (int v : s) {
      rep(i,3) {
        if (sz(x[i]) == 0) continue;
        ans[v] = x[i].back();
        x[i].pop_back();
        break;
      }
    }
  } else {
    assert(sz(t) >= sz(x[2]));
    assert(sz(t) <= sz(x[2])+sz(x[0]));
    for (int v : t) {
      rep(xi,2) {
        int i = xi==0?2:0;
        if (sz(x[i]) == 0) continue;
        ans[v] = x[i].back();
        x[i].pop_back();
        break;
      }
    }
    for (int v : s) {
      rep(i,3) {
        if (sz(x[i]) == 0) continue;
        ans[v] = x[i].back();
        x[i].pop_back();
        break;
      }
    }
  }
  cout<<ans<<endl;
  return 0;
}






















Measured memory_bytes: 22644