#include <bits/stdc++.h>
using namespace std;
set<int> G[200005];
int st[200005], n, ans;
bool deuruim;
int val[2], qual_ponta, diametro, ponta[2];
int dist[2][200005];
void dia(int v, int p, int d) {
  diametro = max(diametro, d);
  if (d > val[qual_ponta]) {
    val[qual_ponta] = d;
    ponta[qual_ponta] = v;
  }
  for (int u : G[v]) {
    if (p != u) dia(u, v, d + 1);
  }
}
void dia2(int v, int p, int d, int tp) {
  dist[tp][v] = d;
  for (int u : G[v]) {
    if (p != u) dia2(u, v, d + 1, tp);
  }
}
void calc(int v, int p) {
  st[v] = 1;
  for (int x : G[v]) {
    if (x != p) {
      calc(x, v);
      st[v] += st[x];
    }
  }
}
bool dfs(int v, int p) {
  int filhos = 0;
  bool flag = 0;
  map<int, vector<int> > tab;
  st[v] = 1;
  for (int x : G[v]) {
    if (x == p) continue;
    filhos++;
    bool aux = dfs(x, v);
    flag |= aux;
    st[v] += st[x];
    if (!aux) {
      tab[st[x]].push_back(x);
    }
  }
  for (auto &it : tab) {
    while ((it.second).size() > 1) {
      G[v].erase((it.second).back());
      st[v] -= st[(it.second).back()];
      filhos--;
      (it.second).pop_back();
    }
  }
  return flag | (filhos >= 2);
}
void check(int v, int p) {
  ans++;
  if (G[v].size() > 2) deuruim = 1;
  for (int x : G[v])
    if (x != p) check(x, v);
}
int main() {
  int a, b;
  scanf("%d", &n);
  for (int i = 1; i < n; i++) {
    scanf("%d%d", &a, &b);
    G[a].insert(b);
    G[b].insert(a);
  }
  diametro = 0;
  val[0] = val[1] = -1;
  qual_ponta = 0;
  dia(1, 0, 0);
  qual_ponta = 1;
  dia(ponta[0], 0, 0);
  dia2(ponta[0], 0, 0, 0);
  dia2(ponta[1], 0, 0, 1);
  int root = -1;
  for (int i = 1; i <= n; i++) {
    if ((diametro + 1) / 2 >= dist[0][i] && (diametro + 1) / 2 >= dist[1][i])
      root = i;
  }
  dfs(root, root);
  ans = 0;
  check(root, root);
  if (deuruim)
    printf("-1\n");
  else {
    ans--;
    while (ans && ans % 2 == 0) ans /= 2;
    printf("%d\n", ans);
  }
  return 0;
}
