#include <bits/stdc++.h>
using namespace std;
vector<int> my[1600];
int xx = 0, yy = 0;
struct ww {
  int x, y, id;
  bool operator<(const ww &o) const {
    if (x - xx >= 0 && o.x - xx <= 0) {
      return true;
    }
    if (x - xx <= 0 && o.x - xx >= 0) {
      return false;
    }
    return (y - yy) * (long long)(o.x - xx) < (o.y - yy) * (long long)(x - xx);
  }
} z[1600];
bool u[1600] = {0};
int a[1600] = {0};
int our[1600] = {0};
int dfs(int x) {
  u[x] = true;
  a[x] = 1;
  int s = my[x].size(), i = 0, y = 0;
  for (i = 0; i < s; i++) {
    y = my[x][i];
    if (!u[y]) {
      a[x] += dfs(y);
    }
  }
  return a[x];
}
void tt(int x, int p, int q) {
  u[x] = true;
  int s = my[x].size(), i = 0, y = 0, t = p, now = 0;
  for (i = p + 1; i <= q; i++) {
    if (z[i].y < z[t].y || z[i].y == z[t].y && z[i].x < z[t].x) {
      t = i;
    }
  }
  if (t != p) {
    swap(z[t], z[p]);
  }
  our[z[p].id] = x;
  xx = z[p].x;
  yy = z[p].y;
  sort(z + p + 1, z + q + 1);
  now = p + 1;
  for (i = 0; i < s; i++) {
    y = my[x][i];
    if (!u[y]) {
      tt(y, now, now + a[y] - 1);
      now += a[y];
    }
  }
}
int main() {
  int i = 0, n = 0, p = 0, q = 0;
  while (scanf("%d", &n) == 1) {
    for (i = 1; i <= n; i++) {
      my[i].clear();
    }
    for (i = 1; i <= n - 1; i++) {
      scanf("%d%d", &p, &q);
      my[p].push_back(q);
      my[q].push_back(p);
    }
    for (i = 1; i <= n; i++) {
      scanf("%d%d", &z[i].x, &z[i].y);
      z[i].id = i;
    }
    memset(u, 0, sizeof(u));
    dfs(1);
    memset(u, 0, sizeof(u));
    tt(1, 1, n);
    for (i = 1; i <= n; i++) {
      printf("%d", our[i]);
      if (i < n) {
        printf(" ");
      } else {
        printf("\n");
      }
    }
  }
  return 0;
}

### Prompt

Please provide a cpp coded solution to the problem described below:

You are given a tree with n vertexes and n points on a plane, no three points lie on one straight line.

Your task is to paint the given tree on a plane, using the given points as vertexes. 

That is, you should correspond each vertex of the tree to exactly one point and each point should correspond to a vertex. If two vertexes of the tree are connected by an edge, then the corresponding points should have a segment painted between them. The segments that correspond to non-adjacent edges, should not have common points. The segments that correspond to adjacent edges should have exactly one common point.

Input

The first line contains an integer n (1 ≤ n ≤ 1500) — the number of vertexes on a tree (as well as the number of chosen points on the plane).

Each of the next n - 1 lines contains two space-separated integers ui and vi (1 ≤ ui, vi ≤ n, ui ≠ vi) — the numbers of tree vertexes connected by the i-th edge.

Each of the next n lines contain two space-separated integers xi and yi ( - 109 ≤ xi, yi ≤ 109) — the coordinates of the i-th point on the plane. No three points lie on one straight line.

It is guaranteed that under given constraints problem has a solution.

Output

Print n distinct space-separated integers from 1 to n: the i-th number must equal the number of the vertex to place at the i-th point (the points are numbered in the order, in which they are listed in the input).

If there are several solutions, print any of them.

Examples

Input

3
1 3
2 3
0 0
1 1
2 0


Output

1 3 2


Input

4
1 2
2 3
1 4
-1 -2
3 5
-3 3
2 0


Output

4 2 1 3

Note

The possible solutions for the sample are given below.

<image> <image>

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
vector<int> my[1600];
int xx = 0, yy = 0;
struct ww {
  int x, y, id;
  bool operator<(const ww &o) const {
    if (x - xx >= 0 && o.x - xx <= 0) {
      return true;
    }
    if (x - xx <= 0 && o.x - xx >= 0) {
      return false;
    }
    return (y - yy) * (long long)(o.x - xx) < (o.y - yy) * (long long)(x - xx);
  }
} z[1600];
bool u[1600] = {0};
int a[1600] = {0};
int our[1600] = {0};
int dfs(int x) {
  u[x] = true;
  a[x] = 1;
  int s = my[x].size(), i = 0, y = 0;
  for (i = 0; i < s; i++) {
    y = my[x][i];
    if (!u[y]) {
      a[x] += dfs(y);
    }
  }
  return a[x];
}
void tt(int x, int p, int q) {
  u[x] = true;
  int s = my[x].size(), i = 0, y = 0, t = p, now = 0;
  for (i = p + 1; i <= q; i++) {
    if (z[i].y < z[t].y || z[i].y == z[t].y && z[i].x < z[t].x) {
      t = i;
    }
  }
  if (t != p) {
    swap(z[t], z[p]);
  }
  our[z[p].id] = x;
  xx = z[p].x;
  yy = z[p].y;
  sort(z + p + 1, z + q + 1);
  now = p + 1;
  for (i = 0; i < s; i++) {
    y = my[x][i];
    if (!u[y]) {
      tt(y, now, now + a[y] - 1);
      now += a[y];
    }
  }
}
int main() {
  int i = 0, n = 0, p = 0, q = 0;
  while (scanf("%d", &n) == 1) {
    for (i = 1; i <= n; i++) {
      my[i].clear();
    }
    for (i = 1; i <= n - 1; i++) {
      scanf("%d%d", &p, &q);
      my[p].push_back(q);
      my[q].push_back(p);
    }
    for (i = 1; i <= n; i++) {
      scanf("%d%d", &z[i].x, &z[i].y);
      z[i].id = i;
    }
    memset(u, 0, sizeof(u));
    dfs(1);
    memset(u, 0, sizeof(u));
    tt(1, 1, n);
    for (i = 1; i <= n; i++) {
      printf("%d", our[i]);
      if (i < n) {
        printf(" ");
      } else {
        printf("\n");
      }
    }
  }
  return 0;
}

```