#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#define ull unsigned long long
#define pll pair<ll, ll>
#define mp make_pair
#define ll long long
#define pb push_back
#define deb(x) cout << #x << " = " << x << endl
#define all(x) x.begin(), x.end()
#define ld long double
const ll mod = (ll)1e9 + 7;
const ll BASE = 47;
const ll inf = (ll)1e18;
const long double e = 2.718281828459;
const long double pi = 3.141592653;
const ld EPS = 1e-9;
using namespace std;
template <class T>
istream& operator>>(istream &in, vector<T> &arr) {
for (T &cnt : arr) {
in >> cnt;
}
return in;
};
void solve() {
ll n;
cin >> n;
vector<vector<pair<ll, ll>>> g(n, vector<pair<ll, ll>>(n, {inf, 0}));
for (int i = 0; i < n; i++) {
ll a, b;
cin >> a >> b;
a--;
b--;
g[a][b] = {1, 1};
g[b][a] = {1, 1};
}
for (int k = 0; k < n; k++) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (g[i][j].first > g[i][k].first + g[k][j].first) {
g[i][j].first = g[i][k].first + g[k][j].first;
g[i][j].second = g[i][k].second * g[k][j].second;
} else if (g[i][j].first == g[i][k].first + g[k][j].first) {
g[i][j].second += g[i][k].second * g[k][j].second;
}
}
}
}
vector<ll> answer(n);
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
answer[g[i][j].first] += g[i][j].second;
}
}
while (answer.back() == 0) {
answer.pop_back();
}
cout << answer.back();
}
int main() {
#ifndef LOCAL
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#else
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
cout.precision(30);
ll seed = time(0);
//cerr << "Seed: " << seed << "\n";
srand(seed);
solve();
return 0;
}
