#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define lsb(x) (x & (-x))

using namespace std;

vector <vector <int>> g, ids;

void dfs(int nod, int par, int e) {
	ids[e].push_back(nod);
	for(auto it : g[nod]) {
		if(it != par) {
			dfs(it, nod, e ^ 1);
		}
	}
}

int main() {
#ifdef HOME
	ifstream cin("C.in");
	ofstream cout("C.out");
#endif
	int i, n;
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);

	cin >> n;
	g.resize(n + 1);
	for(i = 1; i < n; i++) {
		int x, y; cin >> x >> y;
		g[x].push_back(y);
		g[y].push_back(x);
	}

	ids.resize(2);
	dfs(1, 0, 0);
	if(ids[0].size() > ids[1].size()) {
		swap(ids[0], ids[1]);
	}

	vector <int> cnt(3), sol(n + 1);
	for(i = 1; i <= n; i++) {
		cnt[i % 3]++;
	}

	if(ids[0].size() <= cnt[0]) {
		for(i = 0; i < ids[0].size(); i++) {
			sol[ids[0][i]] = 3 * cnt[0];
			cnt[0]--;
		}
		
	}
	else {
		for(i = 0; i < ids[0].size(); i++) {
			if(cnt[2] > 0) {
				cnt[2]--;
				sol[ids[0][i]] = 3 * cnt[2] + 2;
			}
			else {
				sol[ids[0][i]] = 3 * cnt[0];
				cnt[0]--;
			}
		}
	}
	for(i = 1; i <= n; i++) {
		if(sol[i]) continue;
		for(int j = 0; j < 3; j++) {
			if(cnt[j]) {
				sol[i] = j + (cnt[j] - (j > 0)) * 3;
				cnt[j]--;
				break;
			}
		}
	}

	for(i = 1; i <= n; i++) {
		cout << sol[i] << " ";
	}

	return 0;
}

