Problem: Dasha decided to have a rest after solving the problem. She had been ready to start her favourite activity — origami, but remembered the puzzle that she could not solve. 

<image>

The tree is a non-oriented connected graph without cycles. In particular, there always are n - 1 edges in a tree with n vertices.

The puzzle is to position the vertices at the points of the Cartesian plane with integral coordinates, so that the segments between the vertices connected by edges are parallel to the coordinate axes. Also, the intersection of segments is allowed only at their ends. Distinct vertices should be placed at different points. 

Help Dasha to find any suitable way to position the tree vertices on the plane.

It is guaranteed that if it is possible to position the tree vertices on the plane without violating the condition which is given above, then you can do it by using points with integral coordinates which don't exceed 1018 in absolute value.

Input

The first line contains single integer n (1 ≤ n ≤ 30) — the number of vertices in the tree. 

Each of next n - 1 lines contains two integers ui, vi (1 ≤ ui, vi ≤ n) that mean that the i-th edge of the tree connects vertices ui and vi.

It is guaranteed that the described graph is a tree.

Output

If the puzzle doesn't have a solution then in the only line print "NO".

Otherwise, the first line should contain "YES". The next n lines should contain the pair of integers xi, yi (|xi|, |yi| ≤ 1018) — the coordinates of the point which corresponds to the i-th vertex of the tree.

If there are several solutions, print any of them. 

Examples

Input

7
1 2
1 3
2 4
2 5
3 6
3 7

Output

YES
0 0
1 0
0 1
2 0
1 -1
-1 1
0 2

Input

6
1 2
2 3
2 4
2 5
2 6


Output

NO


Input

4
1 2
2 3
3 4

Output

YES
3 3
4 3
5 3
6 3

Note

In the first sample one of the possible positions of tree is: <image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T max2(T x, T y) {
  return (x > y) ? x : y;
}
template <typename T>
T min2(T x, T y) {
  return (x < y) ? x : y;
}
template <typename T>
T min3(T x, T y, T z) {
  return ((x < y)) ? ((x < z) ? x : z) : ((y < z) ? y : z);
}
template <typename T>
T max3(T x, T y, T z) {
  return ((x > y)) ? ((x > z) ? x : z) : ((y > z) ? y : z);
}
template <typename T>
T GCD(T u, T v) {
  if (v == 0) {
    return u;
  } else {
    return GCD(v, u % v);
  }
}
template <typename T>
T LCM(T u, T v) {
  return (u * v) / GCD(u, v);
}
int IsPrime(int u) {
  for (int i = 2; i <= sqrt(u); i++) {
    if (!(u % i)) {
      return 0;
    }
  }
  return 1;
}
long long int power(int n, int p) {
  long long int ans = 1;
  while (p > 0) {
    ans *= n;
    p--;
  }
  return ans;
}
bool comparator(
    pair<long long int, pair<long long int, long long int> > const& a,
    pair<long long int, pair<long long int, long long int> > const& b) {
  return a.first < b.first;
}
const int N = 50;
vector<int> visited(N, 0);
vector<int> adj[N];
vector<pair<long long int, long long int> > ans;
vector<pair<int, int> > movement = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
void DFS(int root, long long int dist, int currDir) {
  int s = adj[root].size();
  vector<int> dir(4, 0);
  int next;
  if (currDir != -1) {
    dir[currDir] = 1;
  }
  for (int i = 0; i < s; i++) {
    next = adj[root][i];
    if (visited[next] != 1) {
      for (int j = 0; j < 4; j++) {
        if (dir[j] == 0) {
          ans[next].first = ans[root].first + movement[j].first * (dist / 2);
          ans[next].second = ans[root].second + movement[j].second * (dist / 2);
          dir[j] = 1;
          visited[next] = 1;
          if (j == 1) currDir = 3;
          if (j == 3) currDir = 1;
          if (j == 0) currDir = 2;
          if (j == 2) currDir = 0;
          break;
        }
      }
      DFS(next, (dist / 2), currDir);
    }
  }
}
int main() {
  int n, u, v, root = 0;
  cin >> n;
  set<int> M;
  for (int i = 0; i < n - 1; i++) {
    cin >> u >> v;
    adj[u - 1].push_back(v - 1);
    adj[v - 1].push_back(u - 1);
  }
  for (int i = 0; i < n; i++) {
    if (adj[i].size() > 4) {
      cout << "NO";
      return 0;
    }
  }
  for (int i = 0; i < n; i++) {
    ans.push_back(make_pair(-1, -1));
  }
  cout << "YES"
       << "\n";
  ans[root] = make_pair(0, 0);
  long long int dist = power(2, 40);
  visited[root] = 1;
  DFS(root, dist, -1);
  for (int i = 0; i < n; i++) {
    cout << ans[i].first << " " << ans[i].second << "\n";
  }
  return 0;
}