#include<bits/stdc++.h>
using namespace std;
vector<int>g[100005];
int vis[100005],c[100005];
queue<int>q;
int main()
{
	int n;
	scanf("%d",&n);
	for(int i=1;i<n;i++)
	{
		int u,v;
		scanf("%d%d",&u,&v);
		g[u].push_back(v);
		g[v].push_back(u);
	}
	vis[1]=1;
	vis[n]=1;
	c[1]=0;
	c[n]=1;
	q.push(1);
	q.push(n);
	while(!q.empty())
	{
		int x=q.front();
		q.pop();
		int xx=c[x];
		for(int i=0;i<g[x].size();i++)
		{
			int t=g[x][i];
			if(!vis[t])
			{
				c[t]=xx;
				vis[t]=1;
				q.push(t);
			}
		}
	}
	int s1=1,s2=1;
	for(int i=1;i<=n;i++)if(c[i])s1++;else s2++;
	if(s1<s2)printf("Fennec\n");else printf("Snuke\n");
	return 0;
}