#include <iostream>
#include <vector>
#include <cmath>
using namespace std; 
#define N 100002
vector<int>g[N];
int parent[N], dis[N];
int n, num=0;
void dfs(int cur, int par){
	int i, now;
	dis[cur] = dis[par] + 1;
	
	for(i=0; i<g[cur].size(); i++){
		now = g[cur][i];		
		if(now == par)
			continue;
		parent[now] = cur;
		dfs(now, cur);
	}
}
// ÇóÒ»¿Ã×ÓÊ÷ÖÐ½áµãµÄÊýÁ¿ 
void dfs1(int cur, int par){
	int i, now;
	num++;	
	for(i=0; i<g[cur].size(); i++){	
		now = g[cur][i];	
		if(now == par)
			continue;
		dfs1(now, cur);
	}
}

int main(){
	int i, to, from, k, cur, cnt, par;
	cin>>n;
	for(i=0; i<n-1; i++){
		cin>>to>>from;
		g[to].push_back(from);
		g[from].push_back(to);
	}
	// Çó1µ½ÆäËû¶¥µãµÄ¾àÀë 
	dis[0] = -1;
	dfs(1, 0);
	k = dis[n] - 1;
	
	cur = n;
	par = parent[cur];
	cnt = 0;
	//cout<<k<<endl;
	// ´ÓµÚn¸ö¶¥µã³ö·¢£¬Í¨¹ýparentÏò¸ù½Úµã»ØËÝ 
	while(1){	
		if(cnt>=k/2 || par == 1)
			break;
		cur = par;
		par = parent[cur];		
		cnt++;	
	}
	//cout<<cur<<' '<<par<<endl; 
	dfs1(cur, par);
	//cout<<num<<endl;
	if(num>n-num)
		cout<<"Snuke";
	else
		cout<<"Fennec"; 
}