#include <bits/stdc++.h>
using namespace std;
const long long N = 3e1;
vector<long long> Graph[N];
long long vis[N];
long long n;
vector<pair<long long, long long> > ans(N);
long long row[] = {1, 0, -1, 0};
long long col[] = {0, 1, 0, -1};
void dfs(long long src, long long dir, long long len) {
  vis[src] = 1;
  dir = (dir + 3) % 4;
  for (auto to : Graph[src]) {
    if (!vis[to]) {
      ans[to].first = ans[src].first + row[dir] * len;
      ans[to].second = ans[src].second + col[dir] * len;
      dfs(to, dir, len / 2);
      dir = (dir + 1) % 4;
    }
  }
}
void solve() {
  cin >> n;
  for (long long i = 1; i <= n - 1; i++) {
    long long u, v;
    cin >> u >> v;
    u--;
    v--;
    Graph[u].push_back(v);
    Graph[v].push_back(u);
  }
  for (long long i = 0; i < n; i++) {
    if (Graph[i].size() > 4) {
      cout << "NO";
      return;
    }
  }
  dfs(0, 0, 1L << N);
  cout << "YES" << '\n';
  for (long long i = 0; i < n; i++) {
    cout << ans[i].first << " " << ans[i].second << '\n';
  }
  return;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  solve();
  return 0;
}
