#include <bits/stdc++.h>
using namespace std;
const long long N = 55;
long long n, du[N];
struct edge {
  long long to, next;
} e[N << 1];
long long head[N], cnt, ansx[N], ansy[N];
long long pos[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
inline void add(long long u, long long v) {
  e[++cnt].to = v;
  e[cnt].next = head[u];
  head[u] = cnt;
}
inline void dfs(long long u, long long f, long long x, long long y,
                long long tag, long long from) {
  long long tot = 0;
  ansx[u] = x, ansy[u] = y;
  for (long long i = head[u]; i; i = e[i].next) {
    long long v = e[i].to;
    if (v == f) continue;
    if (tot == from) tot++;
    dfs(v, u, x + (1 << tag) * pos[tot][0], y + (1 << tag) * pos[tot][1],
        tag - 1, (tot + 2) % 4);
    tot++;
  }
}
signed main() {
  scanf("%lld", &n);
  for (long long i = 1, u, v; i < n; i++) {
    scanf("%lld%lld", &u, &v);
    add(u, v);
    add(v, u);
    du[u]++;
    du[v]++;
    if (du[u] > 4 || du[v] > 4) {
      printf("NO");
      return 0;
    }
  }
  dfs(1, 0, 0, 0, 30, -1);
  printf("YES\n");
  for (long long i = 1; i <= n; i++) {
    printf("%lld %lld\n", ansx[i], ansy[i]);
  }
  return 0;
}
