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 long long maxn = 2e5 + 1, mod = 1e9 + 7;
vector<int> g[maxn];
int dfs(int cur, int par, int h) {
  map<int, int> mapp;
  for (auto it : g[cur]) {
    if (it == par) continue;
    mapp[dfs(it, cur, h + 1)];
  }
  if (mapp.size() > 2) {
    cout << -1;
    exit(0);
  } else if (mapp.size() == 2) {
    if (mapp.find(h) == mapp.end()) {
      cout << -1;
      exit(0);
    } else {
      for (auto it : mapp) {
        if (it.first != h) return it.first + 1;
      }
    }
  } else {
    if (mapp.size() == 0) {
      return 1;
    } else {
      for (auto it : mapp) {
        return it.first + 1;
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  for (long long i = 0; i < n - 1; i++) {
    int u, v;
    cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  int root;
  for (long long i = 0; i < n + 1; i++) {
    if (i == 0) continue;
    if (g[i].size() == 1) {
      root = i;
      break;
    }
  }
  int ans = dfs(root, root, 0);
  ans -= 1;
  while (ans % 2 == 0) ans /= 2;
  cout << ans;
  return 0;
}
