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;
int f(int x) { return x / (x & -x); }
int solve(int n, vector<vector<int>>& e, vector<int>& d) {
  vector<set<int>> l(n + 1);
  vector<int> used(n + 1, false);
  queue<int> Q;
  for (int i = 1; i <= n; i++)
    if (d[i] == 1) Q.push(i);
  for (; !Q.empty(); Q.pop()) {
    int u = Q.front();
    used[u] = true;
    int v = 0;
    for (int i = e[u].size() - 1; i >= 0; i--)
      if (!used[e[u][i]]) v = e[u][i];
    if (v == 0) continue;
    l[v].insert(l[u].empty() ? 1 : *l[u].begin() + 1);
    if (l[v].size() > 2)
      return -1;
    else if (--d[v] == 1 && l[v].size() == 1)
      Q.push(v);
  }
  int cnt = 0, ans = 0;
  for (int i = 1; i <= n; i++)
    if (l[i].size() == 2) cnt++;
  if (cnt > 1) return -1;
  for (int i = 1; i <= n; i++) {
    if (l[i].empty()) continue;
    if (l[i].size() == 2)
      return f(*l[i].begin() + *--l[i].end());
    else
      ans = max(ans, *l[i].begin());
  }
  return f(ans);
}
int main() {
  int n;
  scanf("%d", &n);
  vector<vector<int>> e(n + 1);
  vector<int> d(n + 1, 0);
  for (int i = 1; i < n; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    e[u].push_back(v);
    e[v].push_back(u);
    d[u]++, d[v]++;
  }
  printf("%d\n", solve(n, e, d));
}
