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;
template <typename T1, typename T2>
istream& operator>>(istream& in, pair<T1, T2>& a) {
  in >> a.first >> a.second;
  return in;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& out, pair<T1, T2> a) {
  out << a.first << " " << a.second;
  return out;
}
template <typename T, typename T1>
T amax(T& a, T1 b) {
  if (b > a) a = b;
  return a;
}
template <typename T, typename T1>
T amin(T& a, T1 b) {
  if (b < a) a = b;
  return a;
}
const long long INF = 1e18;
const int32_t M = 1e9 + 7;
const int32_t MM = 998244353;
const long long N = 2e5 + 5;
set<long long> v[N];
set<long long> d[N];
void solve() {
  long long n;
  cin >> n;
  for (long long i = 1; i < n; i++) {
    long long x, y;
    cin >> x >> y;
    v[x].insert(y);
    v[y].insert(x);
  }
  vector<long long> leaves;
  for (long long i = 1; i < n + 1; i++) {
    if ((long long)((v[i]).size()) == 1) {
      d[i].insert(0);
      leaves.push_back(i);
    }
  }
  long long root = 0;
  while ((long long)((leaves).size())) {
    long long tmp = leaves.back();
    leaves.pop_back();
    long long dep = *d[tmp].begin() + 1;
    long long par = *v[tmp].begin();
    v[par].erase(tmp);
    d[par].insert(dep);
    if ((long long)((d[par]).size()) == 1 &&
        (long long)((v[par]).size()) == 1) {
      leaves.push_back(par);
    }
    if ((long long)((v[par]).size()) == 0) {
      root = par;
      break;
    }
  }
  if (root == 0 || (long long)((d[root]).size()) > 2) {
    cout << -1;
    return;
  }
  long long len = 0;
  for (long long x : d[root]) {
    len += x;
  }
  while (len % 2 == 0) {
    len /= 2;
  }
  cout << len;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  while (t--) solve();
  return 0;
}
