#include <iostream>
#include <queue>
#include <map>
#include <list>
#include <vector>
#include <string>
#include <stack>
#include <limits>
#include <climits>
#include <cassert>
#include <fstream>
#include <cstring>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <cstdio>
#include <ciso646>
#include <set>
#include <array>
#include <unordered_map>
#include <unordered_set>
#include <type_traits>

using namespace std;

#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)

#define inf 0x3f3f3f3f3f3f3f3f
#define PB push_back
#define MP make_pair
#define ALL(a) (a).begin(),(a).end()
#define SET(a,c) memset(a,c,sizeof a)
#define CLR(a) memset(a,0,sizeof a)
#define VS vector<string>
#define VI vector<ll>
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define MIN(a,b) (a>b?b:a)
#define MAX(a,b) (a>b?a:b)
#define pi 2*acos(0.0)
#define INFILE() freopen("in0.txt","r",stdin)
#define OUTFILE()freopen("out0.txt","w",stdout)
#define ll long long
#define ull unsigned long long
#define pii pair<ll,ll>
#define pcc pair<char,char>
#define pic pair<ll,char>
#define pci pair<char,ll>
#define eps 1e-14
#define FST first
#define SEC second
#define SETUP cin.tie(0), ios::sync_with_stdio(false), cout << setprecision(15) << std::fixed;

namespace {
	struct input_returnner {
		ll N; input_returnner(ll N_ = 0) :N(N_) {}
		template<typename T> operator vector<T>() const { vector<T> res(N); for (auto &a : res) cin >> a; return std::move(res); }
		template<typename T> operator T() const { T res; cin >> res; return res; }
		template<typename T> T operator - (T right) { return T(input_returnner()) - right; }
		template<typename T> T operator + (T right) { return T(input_returnner()) + right; }
		template<typename T> T operator * (T right) { return T(input_returnner()) * right; }
		template<typename T> T operator / (T right) { return T(input_returnner()) / right; }
		template<typename T> T operator << (T right) { return T(input_returnner()) << right; }
		template<typename T> T operator >> (T right) { return T(input_returnner()) >> right; }
	};
	template<typename T> input_returnner in() { return in<T>(); }
	input_returnner in() { return input_returnner(); }
	input_returnner in(ll N) { return std::move(input_returnner(N)); }
}

template < typename T >
struct is_vector : std::false_type {};

template < typename T >
struct is_vector<std::vector<T>> : std::true_type {};

template < typename T >
constexpr bool is_vector_v = is_vector<T>::value;

template <typename T>
std::ostream& operator<< (std::ostream& out, const std::vector<T>& v) {
	if (!v.empty()) {
		for (int i = 0; i < v.size(); ++i) {
			out << v[i] << (i == v.size() - 1 ? "\n" : (is_vector_v<T> ? "" : ", "));
		}
	}
	return out;
}

ll MOD = 1e9 + 7;

class prime ;

void solve();

signed main() {
	SETUP;
	solve();
#ifdef _DEBUG
	system("pause");
#endif
	return 0;
}

#define int ll

vector<int> DFS(const vector<vector<int> >& G, vector<bool>& memo, int node, int goal) {
	memo[node] = true;
	if (node == goal) return { node };
	for (auto &to : G[node]) {
		if (not memo[to]) {
			vector<int> temp = DFS(G, memo, to, goal);
			if (not temp.empty()) {
				temp.push_back(node);
				return temp;
			}
		}
	}
	return {};
}

void solve() {
	int N; cin >> N;
	vector<vector<int> > G(N);

	for (int i = 0; i < N-1; ++i) {
		int a, b; cin >> a >> b;
		--a; --b;
		G[a].push_back(b);
		G[b].push_back(a);
	}

	vector<bool> memo(N);
	vector<int> path = DFS(G, memo, 0, N - 1);
	std::reverse(ALL(path));

	int center = path.size() / 2 + min(path.size()%2, size_t(1));
	vector<bool> isFirst(N);
	memo = vector<bool>(N);
	queue<int> que;
	for (int i = 0; i < path.size(); ++i) {
		isFirst[path[i]] = (i < center);
		memo[path[i]] = true;
		que.push(path[i]);
	}

	while (not que.empty()) {
		int cur = que.front(); que.pop();
		for (auto &to : G[cur]) if(not memo[to]){
			if (not memo[to]) {
				isFirst[to] = isFirst[cur];
				que.push(to);
				memo[to] = true;
			}
		}
	}

	int cnt = 0;
	for (int i = 0; i < N; ++i) {
		if (isFirst[i]) cnt++;
	}

	if (cnt > N/2) {
		cout << "Fennec" << endl;
	}
	else{
		cout << "Snuke" << endl;
	}
}


Measured memory_bytes: 18292