//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#pragma warning(disable:4786)
#pragma warning(disable:4996)
#include <ctime>
#include<list>
#include <numeric>
#include<bitset>
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<functional>
#include<string>
#include<cstring>
#include<cstdlib>
#include<queue>
#include<utility>
#include<fstream>
#include<sstream>
#include<cmath>
#include<stack>
#include<assert.h>
#include<unordered_map>
#include<unordered_set>
#include <array>
using namespace std;

#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
	~debug() { cerr << endl; }
	template<class c> typename enable_if<sizeof dud<c>(0) != 1, debug&>::type operator<<(c i) {
		cerr << boolalpha << i; return *this;
	}

	template<class c, int = 0> typename enable_if<sizeof dud<c>(0) == 1, debug&>::type operator<<(c i) {
		return *this << range(begin(i), end(i));
	}

	sim, class b dor(pair < b, c > d) {
		ris << "(" << d.first << ", " << d.second << ")";
	}
	sim dor(rge<c> d) {
		*this << "[";
		for (auto it = d.b; it != d.e; ++it)
			*this << ", " + 2 * (it == d.b) << *it;
		ris << "]";
	}
#else
	sim dor(const c&) { ris; }
#endif
};
#define watch(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

#define MEM(a, b) memset(a, (b), sizeof(a))
#define CLR(a) memset(a, 0, sizeof(a))
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define ABS(X) ( (X) > 0 ? (X) : ( -(X) ) )
#define S(X) ( (X) * (X) )
#define SZ(V) (int )V.size()
#define FORN(i, n) for(int i = 0; i < n; i++)
#define FORAB(i, a, b) for(int i = a; i <= b; i++)
#define ALL(V) V.begin(), V.end()
#define IN(A, B, C)  ((B) <= (A) && (A) <= (C))
#define AIN(A, B, C) assert(IN(A, B, C))

//typedef int LL;
typedef long long int LL;
//typedef __int128 LLL;
typedef long long LLL;

typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<double, double> PDD;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PLL > VPL;
typedef vector<PII > VP;
typedef vector<double> VD;
typedef vector<vector<int>> VVI;
typedef vector<string> VS;
typedef long double ld;

#define MAXN 100005
//const LL MOD = 1000000007;
const LL MOD = 998244353;
const LL INF = 2000000000000000001LL;

VI color[4];
VI adj[200005];
int ans[200005];
int n;

void dfs(int at, int col, int par) {
	color[col].push_back(at);
	for (int u : adj[at]) {
		if (u == par) continue;
		dfs(u, 3 - col, at);
	}
}

void solve(int ks) {
	scanf("%d", &n);
	for (int i = 1; i < n; i++) {
		int u, v;
		scanf("%d %d", &u, &v);
		adj[u].push_back(v);
		adj[v].push_back(u);
	}

	dfs(1, 1, -1);

	if (n <= 3) {
		for (int i = 1; i <= n; i++) printf("%d ", i);
		return;
	}

	int cnt[4];
	cnt[0] = cnt[1] = cnt[2] = 0;
	for (int i = 1; i <= n; i++) cnt[i % 3]++;
	VI Z[4];
	for (int i = 1; i <= n; i++) Z[i % 3].push_back(i);
	if (SZ(color[1]) >= cnt[1] && SZ(color[2]) >= cnt[2]) {
		// okay
	}
	else {
		swap(color[1], color[2]);
		if (SZ(color[1]) >= cnt[1] && SZ(color[2]) >= cnt[2]) {
			// okay
		}
		else {
			if (SZ(color[1]) > SZ(color[2])) swap(color[1], color[2]);
			for (int i : color[1]) {
				int u = Z[0].back();
				Z[0].pop_back();
				ans[i] = u;
			}
			for (int i : color[2]) {
				int u;
				int t;
				if (Z[0].size()) t = 0;
				else if (Z[1].size()) t = 1;
				else t = 2;
				u = Z[t].back();
				Z[t].pop_back();
				ans[i] = u;
			}
			for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
			return;
		}
	}


	for (int i : color[1]) {
		int u;
		if (Z[1].size()) {
			u = Z[1].back();
			Z[1].pop_back();
		}
		else {
			u = Z[0].back();
			Z[0].pop_back();
		}
		ans[i] = u;
	}

	for (int i : color[2]) {
		int u;
		if (Z[2].size()) {
			u = Z[2].back();
			Z[2].pop_back();
		}
		else {
			u = Z[0].back();
			Z[0].pop_back();
		}
		ans[i] = u;
	}

	for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
}

void gen() {
}

int main()
{
	double start_time = clock();
#ifdef LOCAL
	freopen("C:\\Home\\ContestCodes\\sample.in", "r", stdin);
	//	freopen("out.out", "w", stdout);
#endif

	gen();

	if (0) {
		int T;
		scanf("%d", &T);
		AIN(T, 1, 5000);
		for (int ks = 1; ks <= T; ks++) {
			solve(ks);
			//fprintf(stderr, "%d done\n", ks);
		}
	}
	else {
		solve(0);
	}

	double end_time = clock();
	fprintf(stderr, "Time = %lf\n", (end_time - start_time) / CLOCKS_PER_SEC);

	return 0;
}


Measured memory_bytes: 22260