#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> g[200005];
int d[200005];
bool check[200005];
queue<int> q;
int first_err = -1;
set<int> s[200005];
int dfs(int u, int par) {
  for (int i = 0; i < (int)g[u].size(); i++) {
    int v = g[u][i];
    if (v == par) continue;
    s[u].insert(dfs(v, u));
  }
  if (s[u].empty())
    return 1;
  else {
    if (par == -1) {
      if (s[u].size() > 2)
        return -1;
      else {
        int res = 0;
        for (set<int>::iterator it = s[u].begin(); it != s[u].end(); ++it) {
          if ((*it) == -1) return -1;
          res += (*it);
        }
        return res;
      }
    } else {
      if (s[u].size() > 1) {
        if (first_err == -1) first_err = u;
        return -1;
      } else {
        set<int>::iterator it = s[u].begin();
        if ((*it) == -1) return -1;
        return (*it) + 1;
      }
    }
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i < n; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    d[x]++;
    d[y]++;
    g[x].push_back(y);
    g[y].push_back(x);
  }
  for (int i = 1; i <= n; i++)
    if (d[i] == 1) q.push(i);
  int last = -1;
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    check[u] = true;
    last = u;
    for (int i = 0; i < g[u].size(); i++) {
      int v = g[u][i];
      if (check[v]) continue;
      d[v]--;
      if (d[v] == 1) q.push(v);
    }
  }
  int r1 = dfs(last, -1);
  if (r1 != -1)
    while (r1 % 2 == 0) r1 /= 2;
  int r2 = -1;
  if (first_err != -1) {
    for (int i = 1; i <= n; i++) s[i].clear();
    r2 = dfs(first_err, -1);
    if (r2 != -1)
      while (r2 % 2 == 0) r2 /= 2;
  }
  printf("%d\n", max(r1, r2));
  return 0;
}
