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>
#pragma comment(linker, "/STACK:100000000")
using namespace std;
const int N = 200100;
vector<int> m[N], v[N];
queue<int> q;
int h[N], u[N];
int main() {
  int n, i, j, k;
  scanf("%d", &n);
  for (k = n - 1; k--;
       scanf("%d%d", &i, &j), i--, j--, m[i].push_back(j), m[j].push_back(i))
    ;
  for (i = 0; i < n; i++) {
    h[i] = m[i].size();
    if (h[i] == 1) {
      q.push(i);
      v[i].push_back(0);
    }
  }
  for (; !q.empty();) {
    i = q.front();
    q.pop();
    k = v[i][0];
    u[i] = 1;
    if (h[i] > 0) {
      bool ok = 1;
      for (int j : v[i])
        if (j != k) ok = 0;
      if (!ok) break;
    }
    for (int j : m[i])
      if (!u[j]) {
        h[j]--;
        v[j].push_back(k + 1);
        if (h[j] == 1) q.push(j);
      }
  }
  if (h[i] > 0)
    printf("-1\n");
  else {
    sort(v[i].begin(), v[i].end());
    v[i].resize(unique(v[i].begin(), v[i].end()) - v[i].begin());
    if (v[i].size() > 2)
      printf("-1\n");
    else {
      k = 0;
      for (int j : v[i]) k += j;
      for (; k % 2 == 0; k /= 2)
        ;
      printf("%d\n", k);
    }
  }
  return 0;
}
