#include <bits/stdc++.h>
using namespace std;
long long int power(long long int a, long long int b) {
  long long int res = 1;
  a %= 1000000000000000001;
  assert(b >= 0);
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % 1000000000000000001;
    a = a * a % 1000000000000000001;
  }
  return res;
}
long long int modInverse(long long int a) {
  return power(a, 1000000000000000001 - 2);
}
const int N = 500023;
bool vis[N];
vector<int> adj[N];
void solve() {
  long long int n;
  cin >> n;
  for (long long int i = 0; i < n - 1; i++) {
    long long int a, b;
    cin >> a >> b;
    adj[a].push_back(b);
    adj[b].push_back(a);
  }
  for (int i = 1; i <= n; i++) {
    if (adj[i].size() > 4) {
      cout << "NO";
      return;
    }
  }
  queue<int> q;
  q.push(1);
  map<long long int, pair<long long int, long long int>> coor;
  map<pair<long long int, long long int>, long long int> mark;
  coor[1] = make_pair((long long int)0, (long long int)0);
  long long int dist = power(2, 50);
  vis[1] = 1;
  mark[make_pair((long long int)0, (long long int)0)] = 1;
  pair<int, int> arr[4] = {make_pair(-1, 0), make_pair(0, 1), make_pair(0, -1),
                           make_pair(1, 0)};
  map<pair<long long int, long long int>, long long int> dir;
  while (!q.empty()) {
    long long int curr = q.front();
    q.pop();
    for (auto it : adj[curr]) {
      if (vis[it]) continue;
      vis[it] = 1;
      q.push(it);
      for (int i = 0; i < 4; i++) {
        pair<long long int, long long int> coordinate =
            make_pair(coor[curr].first + dist * arr[i].first,
                      coor[curr].second + dist * arr[i].second);
        if (mark[coordinate]) continue;
        if (dir[make_pair(curr, i)]) continue;
        dir[make_pair(curr, i)] = 1;
        dir[make_pair(it, 3 - i)] = 1;
        mark[coordinate] = 1;
        coor[it] = coordinate;
        dist /= 2;
        break;
      }
    }
  }
  cout << "YES\n";
  for (int i = 1; i <= n; i++)
    cout << coor[i].first << ' ' << coor[i].second << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int T = 1;
  int t = 0;
  while (t++ < T) {
    solve();
  }
  cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC
       << "ms\n";
}
