#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <iomanip>
#include <limits>
#include <list>
#include <queue>
#include <tuple>
#include <map>
#include <stack>
#include <set>
#include <bitset>
#include <functional>
using namespace std;
#define fast_io ios_base::sync_with_stdio (false) ; cin.tie(0) ; cout.tie(0) ;
#define ll long long int
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define reps(i,n) for(int i=1; i<=(int)(n); i++)
#define REP(i,n) for(int i=n-1; i>=0; i--)
#define REPS(i,n) for(int i=n; i>0; i--)
#define MOD (long long int)(1e9+7)
#define INF (int)(1123456789)
#define LINF (long long int)(112345678901234567)
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
#define all(v) v.begin(), v.end()
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;

ll mpow(ll a, ll b){
  if(b==0) return 1;
  else if(b%2==0){ll memo = mpow(a,b/2); return memo*memo%MOD;}
  else return mpow(a,b-1) * a % MOD;
}
ll lpow(ll a, ll b){
  if(b==0) return 1;
  else if(b%2==0){ll memo = lpow(a,b/2); return memo*memo;}
  else return lpow(a,b-1) * a;
}
ll gcd(ll a, ll b){
  if(b==0) return a;
  else return gcd(b, a%b);
}
vector<ll> kaijo_memo;
ll kaijo(ll n){
  if(kaijo_memo.size() > n) return kaijo_memo[n];
  if(kaijo_memo.size() == 0) kaijo_memo.push_back(1);
  while(kaijo_memo.size() <= n) kaijo_memo.push_back(kaijo_memo[kaijo_memo.size()-1] * kaijo_memo.size() % MOD);
  return kaijo_memo[n];
}
vector<ll> gyaku_kaijo_memo;
ll gyaku_kaijo(ll n){
  if(gyaku_kaijo_memo.size() > n) return gyaku_kaijo_memo[n];
  if(gyaku_kaijo_memo.size() == 0) gyaku_kaijo_memo.push_back(1);
  while(gyaku_kaijo_memo.size() <= n) gyaku_kaijo_memo.push_back(gyaku_kaijo_memo[gyaku_kaijo_memo.size()-1] * mpow(gyaku_kaijo_memo.size(), MOD-2) % MOD);
  return gyaku_kaijo_memo[n];
}

ll nCr(ll n, ll r){
  if(n == r) return 1;//0個の丸と-1個の棒みたいな時に時に効く？不安.
  if(n < r || r < 0) return 0;
  ll ret = 1;
  if(n <= 1e7){
    ret *= kaijo(n); ret %= MOD;
    ret *= gyaku_kaijo(r); ret %= MOD;
    ret *= gyaku_kaijo(n-r); ret %= MOD;
  }else{
    rep(i,r){
      ret *= n-i; ret %= MOD;
      ret *= mpow(r-i, MOD-2); ret %= MOD;
    }
  }
  return ret;
}

vector<int> G[(int)2e5], H[(int)2e5];
bool checked[(int)2e5];

void saiki(int now, int h){
  if(checked[now]) return;
  checked[now] = true;
  H[h].push_back(now);
  rep(j,G[now].size()){
    int next = G[now][j];
    saiki(next, h+1);
  }
  return;
}

int main(void){
  fast_io
  cout<<fixed<<setprecision(15);
  int n;cin>>n;
  rep(i,n-1){
    int a,b;cin>>a>>b;a--;b--;
    G[a].push_back(b);
    G[b].push_back(a);
  }
  rep(i,n){
    checked[i] = false;
  }

  saiki(0, 0);
  int c0 = 0, c1 = 0;
  rep(i,n){
    if(i%2==0){
      c0 += H[i].size();
    }else{
      c1 += H[i].size();
    }
  }

  vector<int> ans(n, -1);

  //小さい方に3
  //大きい方に1,2
  if(min(c0, c1) < (n+1)/3){
    int maxC;
    if(c0 > c1){
      maxC = 0;
    }else{
      maxC = 1;
    }
    vector<int> remain;
    reps(i,n){
      if(i%3 == 0) continue;
      remain.push_back(i);
    }
    reps(i,n){
      if(i%3 != 0) continue;
      remain.push_back(i);
    }
    int ri = 0;
    rep(i,n){
      if(i%2 != maxC) continue;
      rep(j,H[i].size()){
        int next = H[i][j];
        ans[next] = remain[ri];
        ri++;
      }
    }
    rep(i,n){
      if(i%2 == maxC) continue;
      rep(j,H[i].size()){
        int next = H[i][j];
        ans[next] = remain[ri];
        ri++;
      }
    }
  }else{
    //大きい方に1
    //小さい方に2
    //最後に3
    int maxC;
    if(c0 > c1){
      maxC = 0;
    }else{
      maxC = 1;
    }

    vector<int> remain;
    reps(i,n){
      if(i%3 == 1){
        remain.push_back(i);
      }
    }
    reps(i,n){
      if(i%3 == 2){
        remain.push_back(i);
      }
    }
    reps(i,n){
      if(i%3 == 0){
        remain.push_back(i);
      }
    }

    int ri = 0;
    //1を大きい方に入れる
    rep(i,n){
      if(remain[ri]%3 != 1) break;
      if(i%2 != maxC){
        continue;
      }

      rep(j,H[i].size()){
        if(remain[ri]%3 != 1) break;
        int next = H[i][j];
        ans[next] = remain[ri];
        ri++;
      }
    }

    rep(i,n){
      if(remain[ri]%3 != 2) break;
      if(i%2 == maxC){
        continue;
      }

      rep(j,H[i].size()){
        if(remain[ri]%3 != 2)break;
        int next = H[i][j];
        ans[next] = remain[ri];
        ri++;
      }
    }

    //3を余ったところへ
    rep(i,n){
      if(ans[i] == -1){
        ans[i] = remain[ri];
        ri++;
      }
    }
  }

  rep(i,n){
    cout<<ans[i]<<" ";
  }
  cout<<endl;

}

Measured memory_bytes: 28284