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 n, D[201000], first = 0;
vector<int> E[201000];
void DFS(int a, int pp) {
  int i;
  vector<int> TP;
  for (i = 0; i < E[a].size(); i++) {
    if (E[a][i] == pp) continue;
    DFS(E[a][i], a);
    if (D[E[a][i]] == -1) {
      D[a] = -1;
      return;
    }
    TP.push_back(D[E[a][i]] + 1);
  }
  if (TP.empty()) {
    D[a] = 0;
    return;
  }
  sort(TP.begin(), TP.end());
  int ck = 0;
  for (i = 0; i < TP.size() - 1; i++) {
    if (TP[i] != TP[i + 1]) {
      ck++;
    }
  }
  if (pp != 0) {
    if (ck) {
      D[a] = -1;
      first = a;
      return;
    }
    D[a] = TP[0];
  }
  if (pp == 0) {
    if (ck > 1) {
      D[a] = -1;
      first = a;
      return;
    }
    if (ck == 1) {
      D[a] = TP[0] + TP[TP.size() - 1];
    } else
      D[a] = TP[0];
  }
}
int main() {
  int i, a, b, g = 0;
  scanf("%d", &n);
  for (i = 1; i < n; i++) {
    scanf("%d%d", &a, &b);
    E[a].push_back(b);
    E[b].push_back(a);
  }
  a = -1;
  for (i = 1; i <= n; i++) {
    if (E[i].size() >= 3) a = i;
  }
  if (a == -1) {
    a = n - 1;
    while (a % 2 == 0) a /= 2;
    printf("%d\n", a);
    return 0;
  }
  DFS(a, 0);
  if (D[a] != -1) {
    g = D[a];
  } else {
    DFS(first, 0);
    if (D[first] == -1) {
      printf("-1\n");
      return 0;
    }
    g = D[first];
  }
  while (g % 2 == 0) g /= 2;
  printf("%d\n", g);
}
