#include<bits/stdc++.h>
using namespace std;
int n;
int dist[100005],d1[100005],d2[100005];
vector<int> v[100005];
int main()
{
	scanf("%d",&n);
	for (int i=0;i<n-1;i++)
	{
		int x,y;
		scanf("%d %d",&x,&y);
		v[x].push_back(y);
		v[y].push_back(x);
	}
	queue<int> q;
	q.push(1);
	dist[1]=0;
	while (!q.empty())
	{
		int f=q.front();
		q.pop();
		for (int i=0;i<v[f].size();i++)
		{
			int x=v[f][i];
			if (dist[x]==0)
			{
				dist[x]=dist[f]+1;
				q.push(x);
			}
		}
	}
	int len=dist[n];
//	cout<<len;
	int h1=0,h2=0;
	if (len%2!=0)
	{
		h1=1;
	}
	queue<int> qe1;
	qe1.push(1);
	while(!q.empty())
	{
		int f=qe1.front();
		qe1.pop();
		for (int i=0;i<v[f].size();i++)
		{
			int x=v[f][i];
			if (x!=n)
			{
				if (dist[x]==0)
				{
					h1++;
					qe1.push(x);
				}
			}
		}
	}
	queue<int> qe2;
	qe2.push(n);
	while(!q.empty())
	{
		int f=qe2.front();
		qe2.pop();
		for (int i=0;i<v[f].size();i++)
		{
			int x=v[f][i];
			if (x!=1)
			{
				if (dist[x]==0)
				{
					h2++;
					qe2.push(x);
				}
			}
		}
	}
	if (h1>h2)
	{
		cout<<"Snuke";
	}
	else
	{
		cout<<"Fennec";
	}
	return 0;
}