Problem: We have a tree with N vertices. The vertices are numbered 1 to N, and the i-th edge connects Vertex a_i and Vertex b_i.

Takahashi loves the number 3. He is seeking a permutation p_1, p_2, \ldots , p_N of integers from 1 to N satisfying the following condition:

* For every pair of vertices (i, j), if the distance between Vertex i and Vertex j is 3, the sum or product of p_i and p_j is a multiple of 3.



Here the distance between Vertex i and Vertex j is the number of edges contained in the shortest path from Vertex i to Vertex j.

Help Takahashi by finding a permutation that satisfies the condition.

Constraints

* 2\leq N\leq 2\times 10^5
* 1\leq a_i, b_i \leq N
* The given graph is a tree.

Input

Input is given from Standard Input in the following format:


N
a_1 b_1
a_2 b_2
\vdots
a_{N-1} b_{N-1}


Output

If no permutation satisfies the condition, print `-1`.

Otherwise, print a permutation satisfying the condition, with space in between. If there are multiple solutions, you can print any of them.

Example

Input

5
1 2
1 3
3 4
3 5


Output

1 2 5 4 3

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
 
#define f first
#define s second
#define pb push_back
#define mp make_pair
 
using namespace std;
 
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
 
const int N = (int)2e5 + 123, inf = 1e9, mod = 1e9 + 7;
const ll INF = 1e18;
 
vector< int > g[N], a[2], b[3];
int n, m, c[N], ans[N];
void dfs(int v, int p){
	c[v] = c[p] ^ 1;
	a[c[v]].pb(v);
	for(auto to : g[v])
		if(to != p)
			dfs(to, v);
}            
int aa(int i){
	int x = a[i].back();
	a[i].pop_back();
	return x;
}
int bb(int i){
	int x = b[i].back();
	b[i].pop_back();
	return x;
}
void ff(int i, int j){
	while(a[i].size() && b[j].size())
		ans[aa(i)] = bb(j);
}
int main()
{
	scanf("%d", &n);
	m = n - 1;
	for(int i = 0; i < m; i++){
		int v, u;
		scanf("%d%d", &v, &u);
		g[v].pb(u);
		g[u].pb(v);
	}
	dfs(1, 1);
	for(int i = 1; i <= n; i++)
		b[i % 3].pb(i);
	if(a[0].size() > a[1].size()){
		ff(0, 1);
	}else{
		ff(1, 1);	
	}        
	if(a[0].size() > a[1].size()){
		ff(0, 2);
	}else{
		ff(1, 2);	
	}        
	ff(0, 0);
	ff(1, 0);
	assert(a[0].empty());
	assert(a[1].empty());
	for(int i = 1; i <= n; i++)
		printf("%d ", ans[i]);
}