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;
vector<int> adj[200010];
int n, deg[200010];
int find_center() {
  queue<int> fila;
  for (int i = 0; i < n; i++)
    if (deg[i] == 1) {
      fila.push(i);
    }
  int ans = 0;
  while (((int)(fila).size())) {
    int v = fila.front();
    fila.pop();
    for (auto &it : adj[v]) {
      deg[it]--;
      if (deg[it] == 1) fila.push(it);
    }
    ans = v;
  }
  return ans;
}
int solve(int v, int fat = -1) {
  set<int> tm;
  for (auto &it : adj[v]) {
    if (it != fat) {
      int tam = solve(it, v);
      tm.insert(tam);
    }
  }
  if (((int)(tm).size()) == 1) {
    return (*tm.begin()) + 1;
  } else if (((int)(tm).size()) == 2 && fat == -1) {
    return *tm.begin() + (*next(tm.begin())) + 1;
  } else if (((int)(tm).size()) == 0)
    return 1;
  cout << -1 << '\n';
  exit(0);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n;
  for (int i = 1; i < n; i++) {
    int a, b;
    cin >> a >> b;
    --a;
    --b;
    adj[a].push_back(b);
    adj[b].push_back(a);
    deg[a]++;
    deg[b]++;
  }
  int root = find_center();
  int tam = solve(root) - 1;
  while (tam % 2 == 0) tam /= 2;
  cout << tam << '\n';
}
