#include <bits/stdc++.h>
using namespace std;
int n, u, v, cnt[200100], dep[200100], root, ans, len[200100], tot, a[200100],
    son[200100];
bool flag[200100];
struct edge {
  int v;
  edge *nxt;
} pool[400100], *tp = pool, *fst[200100];
int getint() {
  char ch;
  while (!isdigit(ch = getchar()))
    ;
  int x = ch - '0';
  for (; isdigit(ch = getchar()); x = x * 10 + ch - '0')
    ;
  return x;
}
int cmp(int x, int y) { return len[x] < len[y]; }
void dfs1(int x, int fa) {
  dep[x] = dep[fa] + 1;
  for (edge *i = fst[x]; i; i = i->nxt)
    if (i->v != fa) dfs1(i->v, x);
  tot = 0;
  for (edge *i = fst[x]; i; i = i->nxt)
    if (i->v != fa && len[i->v]) a[++tot] = i->v;
  sort(a + 1, a + 1 + tot, cmp);
  for (int i = 2; i <= tot; ++i)
    if (len[a[i]] == len[a[i - 1]]) flag[a[i]] = 1;
  for (edge *i = fst[x]; i; i = i->nxt)
    if (i->v != fa && !flag[i->v])
      if (len[i->v] && !len[x])
        len[x] = len[i->v];
      else
        len[x] = -1;
  ++len[x];
}
void dfs2(int x, int fa) {
  if (len[x]) {
    ans = len[x] + dep[x] - 1;
    return;
  }
  for (edge *i = fst[x]; i; i = i->nxt)
    if (i->v != fa && !flag[i->v])
      if (!len[i->v] || len[i->v] != dep[x] - 1) {
        if (son[x]) {
          puts("-1");
          exit(0);
        }
        son[x] = i->v;
      } else
        flag[i->v] = 1;
  dfs2(son[x], x);
}
int main() {
  n = getint();
  for (int i = 1; i <= n - 1; ++i) {
    ++cnt[u = getint()], ++cnt[v = getint()];
    *tp = (edge){v, fst[u]}, fst[u] = tp++;
    *tp = (edge){u, fst[v]}, fst[v] = tp++;
  }
  for (int i = 1; i <= n; ++i)
    if (cnt[i] == 1) root = i;
  dfs1(root, 0);
  dfs2(root, 0);
  for (; ans & 1; ans = (ans + 1) / 2)
    ;
  printf("%d\n", ans - 1);
  return 0;
}
