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> edges[222222];
int dfs(int par, int u) {
  vector<pair<int, int> > xv;
  unordered_map<int, int> v_to_x;
  for (int j = 0; j < edges[u].size(); j++) {
    int v = edges[u][j];
    if (par == v) continue;
    int x = dfs(u, v);
    if (x != -1) {
      xv.push_back(make_pair(x, v));
    }
    v_to_x[v] = x;
  }
  sort(xv.begin(), xv.end());
  unordered_set<int> discard;
  for (int j = 1; j < xv.size(); j++) {
    if (xv[j].first == xv[j - 1].first) discard.insert(xv[j].second);
  }
  vector<int> new_edges;
  int deg = 0;
  for (int j = 0; j < edges[u].size(); j++) {
    int v = edges[u][j];
    if (par == v) continue;
    if (discard.find(v) == discard.end()) {
      new_edges.push_back(v);
      deg++;
    }
  }
  if (par != -1) new_edges.push_back(par);
  edges[u] = new_edges;
  if (deg == 0) {
    return 1;
  } else if (deg == 1) {
    if (v_to_x[new_edges[0]] == -1)
      return -1;
    else
      return v_to_x[new_edges[0]] + 1;
  } else {
    return -1;
  }
}
void dfs2(int par, int u, vector<int>* verts) {
  verts->push_back(u);
  for (int j = 0; j < edges[u].size(); j++) {
    int v = edges[u][j];
    if (v == par) continue;
    dfs2(u, v, verts);
  }
}
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n - 1; i++) {
    int u, v;
    cin >> u >> v;
    edges[u].push_back(v);
    edges[v].push_back(u);
  }
  vector<int> verts;
  for (int i = 1; i <= n; i++) verts.push_back(i);
  while (1) {
    int maxd = 0;
    int rt = -1;
    for (int id = 0; id < verts.size(); id++) {
      int i = verts[id];
      if (edges[i].size() > maxd) {
        rt = i;
        maxd = edges[i].size();
      }
    }
    if (maxd <= 2) break;
    dfs(-1, rt);
    int psize = verts.size();
    verts.clear();
    dfs2(-1, rt, &verts);
    if (verts.size() == psize) break;
  }
  int maxd = 0;
  for (int id = 0; id < verts.size(); id++)
    maxd = max(maxd, (int)edges[verts[id]].size());
  if (maxd > 2) {
    printf("-1\n");
    return 0;
  } else if (maxd == 1) {
    printf("%d\n", (int)verts.size() - 1);
  } else {
    int sz = verts.size();
    while (sz % 2 == 1) {
      sz = (sz + 1) / 2;
    }
    printf("%d\n", sz - 1);
  }
}
