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 int N = 200010;
vector<int> e[N];
set<int> l[N];
int n;
void exitno() {
  printf("-1\n");
  exit(0);
}
int exitans(int x) {
  while (x % 2 == 0) x /= 2;
  printf("%d\n", x);
  exit(0);
}
void _dfs(int p, int fa) {
  if (fa && e[p].size() == 1) l[p].insert(0);
  for (int i = 0; i < e[p].size(); i++) {
    int x = e[p][i];
    if (x == fa) continue;
    _dfs(x, p);
    for (auto j : l[x]) l[p].insert(j + 1);
  }
  if (l[p].size() >= 3) exitno();
}
void work(int p) {
  for (int i = 1; i <= n; i++) l[i].clear();
  _dfs(p, 0);
  int x = 0;
  for (auto i : l[p]) x += i;
  exitans(x);
}
void dfs(int p = 1, int fa = 0) {
  if (fa && e[p].size() == 1) l[p].insert(0);
  for (int i = 0; i < e[p].size(); i++) {
    int x = e[p][i];
    if (x == fa) continue;
    dfs(x, p);
    for (auto j : l[x]) l[p].insert(j + 1);
  }
  if (l[p].size() >= 3) exitno();
  if (l[p].size() == 2) work(p);
}
int main() {
  cin >> n;
  for (int i = 1; i <= n - 1; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    e[x].push_back(y);
    e[y].push_back(x);
  }
  dfs();
  exitans(*l[1].begin());
  return 0;
}
