#include<iostream>
#include<vector> 
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;//ÔÚÕâ¸öµØ·½ Ë³±ã¸øparent[]¸³Öµ 
		dfs(now,cur);
	}
}
//ÇóNµÄÄÇÒ»Æ¬ÇøÓòÓÐ¶àÉÙ¸öµã 
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 x,y,i,k,cur,cnt,par,num;
	cin>>n;
	//µÚÒ»²½£ºÊäÈë 
	for(i=0;i<n-1;i++)
	{
		cin>>x>>y;
		g[x].push_back(y);
		g[y].push_back(x); 
	}
	//µÚ¶þ²½£ºÇóÆðÊ¼Ä©Î²µã1~nÖ®¼äµÄµÄµãÊý k 
	dis[0]=-1;
	dfs(1,0);
	k=dis[n]-1;
	//µÚÈý²½£º´ÓÄ©Î²µãn¿ªÊ¼£¬Ïò1»ØËÝ£¬ÕÒµ½ÖÐ¼äµã¡£Í¨¹ýparentÏò¸ù½Úµã»ØËÝ!! 
	cur=n;
	par=parent[cur];
	cnt=0;
	while(1)
	{
		if(cnt>=k/2 || par==1)  //ÎªÊ²Ã´par==1 £¿ 
			break;
		cur=par;
		par=parent[cur];
		cnt++;
	}
	dfs1(cur,par);
	if(num>=n-num)
		cout<<"Snuke"<<endl; 
	else
		cout<<"Fennec"<<endl;

	return 0;
}