10
4 2
7 4
2 6
2 5
4 8
10 3
2 9
9 1
5 10
 10
5 10
7 8
8 3
2 6
3 2
9 7
4 5
10 1
6 4
 4
4 1
4 3
4 2
 3
3 1
1 2
 9
1 2
1 3
1 4
1 5
1 6
6 7
6 8
8 9
 5
1 5
2 3
2 4
1 2
 8
6 1
4 7
4 8
8 5
7 6
4 3
4 2
 7
5 6
5 7
5 1
7 4
6 3
3 2
 3
1 3
3 2
 2
1 2
 5
5 4
4 3
3 1
5 2
 6
1 6
3 1
6 4
5 3
2 5
 11
8 9
2 7
1 11
3 2
9 1
8 5
8 6
5 4
4 10
8 3
 11
11 9
6 7
7 1
8 11
5 6
3 5
9 3
10 8
2 4
4 10
 12
12 6
6 7
8 11
4 8
10 4
12 3
2 10
6 2
12 9
4 1
9 5

-1
 9
 1
 1
 3
 3
 -1
 -1
 1
 1
 1
 5
 1
 5
 -1

#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
struct node {
  int to, next;
} p[N << 2];
int head[N], tot, n, now[N], du[N];
bool vis[N], isok;
vector<pair<int, int> > a;
void add(int x, int y) {
  p[++tot] = (node){y, head[x]};
  head[x] = tot;
  p[++tot] = (node){x, head[y]};
  head[y] = tot;
}
inline void del(int x, int fa) {
  du[fa]--;
  vis[x] = 1;
  for (int i = head[x]; i; i = p[i].next) {
    int y = p[i].to;
    if (vis[y] || y == fa) continue;
    del(y, x);
  }
}
inline void dfs(int x, int fa) {
  int son = 0, id = 0;
  for (int i = head[x]; i; i = p[i].next) {
    int y = p[i].to;
    if (vis[y] || y == fa) continue;
    dfs(y, x);
    if (~now[y])
      son++, id = y;
    else
      son += 2;
  }
  if (!son) {
    now[x] = 1;
    return;
  }
  if (son == 1) {
    now[x] = (~now[id] ? now[id] : -2) + 1;
    return;
  }
  for (int i = head[x]; i; i = p[i].next) {
    int y = p[i].to;
    if (vis[y] || y == fa || now[y] == -1) continue;
    a.push_back(make_pair(now[y], y));
  }
  sort(a.begin(), a.end());
  for (int i = 0; i < a.size(); i++) {
    int r = i;
    while (a[r].first == a[i].first) r++;
    for (int j = i + 1; j < r; j++) del(a[j].second, x), isok = 1;
    i = r - 1;
  }
  now[x] = -1;
}
int check() {
  for (int i = 1; i <= n; i++)
    if (du[i] > 2) return i;
  return -1;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i < n; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    add(x, y);
    du[x]++;
    du[y]++;
  }
  while (1) {
    int root = check();
    isok = 0;
    if (root == -1) break;
    dfs(root, -1);
    if (!isok) break;
  }
  if (check() == -1) {
    int ans = n - 1;
    for (int i = 1; i <= n; i++) ans -= vis[i];
    while (ans % 2 == 0) ans /= 2;
    printf("%d\n", ans);
  } else
    puts("-1");
  return 0;
}
