#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <limits>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <functional>
#include <iomanip>

using namespace std;

#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
using ll = long long;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vvvll = std::vector<vvll>;
#define reps(i, S, E) for (ll i = (S); i <= (E); i++)
#define rep(i, N) reps(i, 0, N-1)
#define deps(i, E, S) for (ll i = (E); i >= (S); i--)
#define dep(i, N) deps(i, N-1, 0)
const ll INF = 1LL << 60;
const int INF_INT = 1 << 30;

template<class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; }return false; }
template<class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; }return false; }
struct mll {
	static ll MOD;
	ll val;
	mll(ll v = 0) : val(v % MOD) { if (val < 0) val += MOD; }
	mll operator - () const { return -val; }
	mll operator + (const mll &b) const { return val + b.val; }
	mll operator - (const mll &b) const { return val - b.val; }
	mll operator * (const mll &b) const { return val * b.val; }
	mll operator / (const mll &b) const { return mll(*this) /= b; }
	mll operator + (ll b) const { return *this + mll(b); }
	mll operator - (ll b) const { return *this - mll(b); }
	mll operator * (ll b) const { return *this * mll(b); }
	friend mll operator + (ll a, const mll &b) { return b + a; }
	friend mll operator - (ll a, const mll &b) { return -b + a; }
	friend mll operator * (ll a, const mll &b) { return b * a; }
	mll &operator += (const mll &b) { val = (val + b.val) % MOD; return *this; }
	mll &operator -= (const mll &b) { val = (val + MOD - b.val) % MOD; return *this; }
	mll &operator *= (const mll &b) { val = (val*b.val) % MOD; return *this; }
	mll &operator /= (const mll &b) {
		ll c = b.val, d = MOD, u = 1, v = 0;
		while (d) {
			ll t = c / d;
			c -= t * d; swap(c, d);
			u -= t * v; swap(u, v);
		}
		val = val * u % MOD;
		if (val < 0) val += MOD;
		return *this;
	}
	mll &operator += (ll b) { return *this += mll(b); }
	mll &operator -= (ll b) { return *this -= mll(b); }
	mll &operator *= (ll b) { return *this *= mll(b); }
	mll &operator /= (ll b) { return *this /= mll(b); }
	bool operator == (const mll &b) { return val == b.val; }
	bool operator != (const mll &b) { return val != b.val; }
	bool operator == (ll b) { return *this == mll(b); }
	bool operator != (ll b) { return *this != mll(b); }
	friend bool operator == (ll a, const mll &b) { return mll(a) == b.val; }
	friend bool operator != (ll a, const mll &b) { return mll(a) != b.val; }
	friend ostream &operator << (ostream &os, const mll &a) { return os << a.val; }
	friend istream &operator >> (istream &is, mll &a) { return is >> a.val; }
	static mll Combination(ll a, ll b) {
		chmin(b, a - b);
		if (b < 0) return mll(0);
		mll c = 1;
		rep(i, b) c *= a - i;
		rep(i, b) c /= i + 1;
		return c;
	}
};
using vmll = std::vector<mll>;
using vvmll = std::vector<vmll>;
using vvvmll = std::vector<vvmll>;
using vvvvmll = std::vector<vvvmll>;

struct Fast {
	Fast() {
		cin.tie(0);
		ios::sync_with_stdio(false);
		cout << fixed << setprecision(std::numeric_limits<double>::max_digits10);
	}
} fast; //cin,cout高速化のおまじない＋桁数指定

ll mll::MOD = (ll)(1e9 + 7);// 998244353ll;


int main() {
	ll N;
	cin >> N;
	//グラフ表現(Nノードのうちノードindexから別のノード番号へ接続)
	vector<vector<ll>> graph(N, vector<ll>(0));
	rep(i, N - 1) {
		ll a;
		cin >> a;
		ll b;
		cin >> b;
		a--;
		b--;
		graph[a].push_back(b);
		graph[b].push_back(a);
	}

	vll distFrom0toN(N, -1);
	distFrom0toN[0] = 0;
	queue<ll> q;
	q.push(0);
	while (q.empty() == false) {
		ll next = q.front();
		q.pop();

		for (auto node : graph[next]) {
			if (distFrom0toN[node] >= 0) {
				continue;
			}
			distFrom0toN[node] = distFrom0toN[next] + 1;
			q.push(node);
		}
	}

	//N-1から0までパスをたどる
	vll routeFromNto0;
	routeFromNto0.push_back(N - 1);
	ll dist = distFrom0toN[N - 1];
	q.push(N - 1);
	while (q.empty() == false) {
		ll next = q.front();
		q.pop();

		for (auto node : graph[next]) {
			if (distFrom0toN[node] == dist - 1) {
				routeFromNto0.push_back(node);
				q.push(node);
				dist--;
			}
		}
	}

	//相手のノードまで最短で向かう
	vll color(N, 0); //colored 1 or 2
	ll indexA = routeFromNto0.size() - 1;
	ll indexB = 0;
	queue<ll> qA; //先手の探索Q
	queue<ll> qB; //後手の探索Q
	rep(i, routeFromNto0.size()) {
		if (i % 2 == 0) {
			//先手
			color[routeFromNto0[indexA]] = 1;
			qA.push(routeFromNto0[indexA]);
			indexA--;
		}
		else {
			//後手
			color[routeFromNto0[indexB]] = 2;
			qB.push(routeFromNto0[indexB]);
			indexB++;
		}
	}

	ll nextMove = routeFromNto0.size(); //偶数なら先手の手番

	//先手の探索
	while (qA.empty() == false) {
		ll next = qA.front();
		qA.pop();

		for (auto node : graph[next]) {
			if (color[node] == 0) {
				color[node] = 1;
				qA.push(node);
			}
		}
	}

	//後手の探索
	while (qB.empty() == false) {
		ll next = qB.front();
		qB.pop();

		for (auto node : graph[next]) {
			if (color[node] == 0) {
				color[node] = 2;
				qB.push(node);
			}
		}
	}

	ll numNodeA = 0;
	ll numNodeB = 0;
	rep(i, N) {
		if (color[i] == 1) {
			numNodeA++;
		}
		else if (color[i] == 2) {
			numNodeB++;
		}
	}

	bool result = numNodeA > numNodeB ? true : false; //true:先手の勝ち

	if (result == true) {
		cout << "Fennec" << endl;
	}
	else {
		cout << "Snuke" << endl;
	}

	return 0;
}


Measured memory_bytes: 8948