#include <bits/stdc++.h>

#define TAM 100001

using namespace std;

int used[TAM];

int main(void){
	int a, b, n;
	cin >> n;
	vector<vector<int> > g(n+1, vector<int>());
	for(int i = 0; i < n-1; i++){
		cin >> a >> b;
		g[a].push_back(b);
		g[b].push_back(a); 
	} 
	queue<int> q, q2;
	int c1, c2;
	c1 = c2 = 0;
	q.push(1);
	q2.push(n);
	used[1] = used[n] = 1;
	while(!q.empty() || !q2.empty()){
		if(!q.empty()){
			int x = q.front();
			q.pop();
			for(int i = 0; i < g[x].size(); i++){
				int v = g[x][i];
				if(!used[v]){
					used[v] = 1;
					q.push(v);
					++c1;
				}
			}
		}
		if(!q2.empty()){
			int x = q2.front();
			q2.pop();
			for(int i = 0; i < g[x].size(); i++){
				int v = g[x][i];
				if(!used[v]){
					used[v] = 1;
					q2.push(v);
					++c2;
				}
			}
		}
	}
	if(c2 >= c1) cout << "Snuke" << endl;
	else cout << "Fennec" << endl;
	return 0;	
}