#include <bits/stdc++.h>
#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)
using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return std::max(low, std::min(high, t)); }
template <typename T> void chclamp(T &t, const T &low, const T &high) { return t = clamp(t, low, high); }
template <typename T> T make_v(T init) { return init; }
template <typename T, typename... Tail> auto make_v(T init, std::size_t s, Tail... tail) { auto v = std::move(make_v(init, tail...)); return vec<decltype(v)>(s, v); }
template <typename T, std::size_t Head, std::size_t ...Tail> struct multi_dem_array { using type = std::array<typename multi_dem_array<T, Tail...>::type, Head>; };
template <typename T, std::size_t Head> struct multi_dem_array<T, Head> { using type = std::array<T, Head>; };
template <typename T, std::size_t ...Args> using mdarray = typename multi_dem_array<T, Args...>::type;
namespace init__ { struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; }

namespace graph {

using Node = ll;
using Weight = ll;
using Edge = std::pair<Node, Weight>;

template <bool Directed>
struct Graph : public vvec<Edge> {
    using vvec<Edge>::vvec;

    void add_edge(Node f, Node t, Weight w = 1) {
        (*this)[f].emplace_back(t, w);
        if (!Directed) (*this)[t].emplace_back(f, w);
    }

    Graph<Directed> build_inv() const {
        Graph<Directed> ret(this->size());
        for (Node i = 0; i < this->size(); i++) {
            for (const Edge &e : (*this)[i]) {
                Node j;
                Weight w;
                std::tie(j, w) = e;
                if (!Directed && j < i) continue;
                ret.add_edge(j, i, w);
            }
        }

        return ret;
    }
};

}

std::queue<ll> one, two;

void dfs(ll cur, ll pre, const graph::Graph<false> &g, ll cnt) {
    (cnt == 0 ? one : two).push(cur);
    for (auto &&e : g[cur]) {
        ll nxt = e.first;
        if (pre == nxt) continue;
        dfs(nxt, cur, g, (cnt + 1) % 2);
    }
}

vec<ll> solve() {
    ll n;
    std::cin >> n;
    graph::Graph<false> g(n);
    for (ll i = 1; i < n; i++) {
        ll a, b;
        std::cin >> a >> b;
        g.add_edge(a - 1, b - 1);
    }

    std::queue<ll> num[3];
    for (ll i = 1; i <= n; i++) num[i % 3].push(i);
    dfs(0, -1, g, 0);

    vec<ll> ans(n, -1);
    if (one.size() > two.size()) std::swap(one, two);
    if (one.size() <= num[0].size()) {
        while (one.size()) {
            ll e = one.front();
            one.pop();
            ans[e] = num[0].front();
            num[0].pop();
        }
    } else {
        for (ll i = 1; i <= 2; i++) {
            auto &q = (i == 1 ? one : two);
            while (q.size() && num[i].size()) {
                ans[q.front()] = num[i].front();
                q.pop();
                num[i].pop();
            }
        }
    }

    for (ll i = 1; i < 3; i++) {
        auto &q = num[i];
        while (q.size()) {
            num[0].push(q.front());
            q.pop();
        }
    }
    for (ll i = 0; i < n; i++) if (ans[i] == -1) {
        ans[i] = num[0].front();
        num[0].pop();
    }

    return ans;
}

int main() {
    auto ans = solve();
    for (ll i = 0; i < ans.size(); i++) std::cout << ans[i] << " \n"[i + 1 == ans.size()];
    return 0;
}


Measured memory_bytes: 24320