#include<bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<(k);i++)
#define mp make_pair
#define sz(a) (int)(a).size()
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<double,double> pdd;
typedef long double ld;
//----head----
const int N=100005;
vector<int> V[N];
int dp[N],dep[N],father[N];
int dfs(int a,int fa,int deep)
{
	father[a]=fa;
	dep[a]=deep;
	int ans=1;
	rep(i,0,sz(V[a]))
	{
		int nex=V[a][i];
		if(nex==fa)continue;
		ans+=dfs(nex,a,deep+1);
	}
	return dp[a]=ans;
}
int main()
{
	int n;
	scanf("%d",&n);
	rep(i,1,n)
	{
		int a,b;
		scanf("%d%d",&a,&b);
		V[a].pb(b);
		V[b].pb(a);
	}
	dfs(1,-1,-1);
	int po=n;
	int step=dep[n]/2;
	while(step--)po=father[po];
	puts(dp[1]-dp[po]>dp[po]?"Fennec":"Snuke");
	return 0;
}
