//ΔARC 078D
#include<iostream>
#include<cstdio>
#include<fstream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<cmath>
#include<cstring>
#include<cstdlib>
using namespace std;
typedef long long LL;
vector<int> v[111111];
int f[111111],t[111111],a[111111];
void dfs(int u,int fa){
	int i;
	f[u]=fa;
	t[u]=1;
	for(i=0;i<v[u].size();i=i+1)
		if(v[u][i]!=fa){
			dfs(v[u][i],u);
			t[u]+=t[v[u][i]];
		}
}
int main()
{
	int n,i,x,y;
	scanf("%d",&n);
	for(i=1;i<n;i=i+1){
		scanf("%d%d",&x,&y);
		v[x].push_back(y);
		v[y].push_back(x);
	}
	dfs(1,0);
	x=n;
	i=0;
	while(x){
		i++;
		a[i]=x;
		x=f[x];
	}
	y=a[i/2];
	x=t[y];
	y=n-x;
	if(x<y)
		cout<<"Fennec\n";
	else
		cout<<"Snuke\n";
	return 0;
}