// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

#define SZ(v) ((int)(v).size())

#define rep(i,n) for(int i=0;i<(n);i++)

#define foreach(it,c) for(__typeof(c.begin()) it=c.begin();it!=c.end();it++)

#define all(v) (v).begin(),(v).end()

typedef long long ll;

typedef unsigned uint;

const int INF=0x3f3f3f3f;

int inline in(){int x=0,c;for(;(uint)((c=getchar())-'0')>=10;)

{if(c=='-')return -in();if(!~c)throw ~0;}do{x=(x<<3)+(x<<1)+(c-'0');}

while((uint)((c=getchar())-'0')<10);return x;}

int n;

vector<int>G[100005];

int dist1[100005],dist2[100005];

void dfs1(int v,int p,int t){

	dist1[v]=t;

	rep(i,SZ(G[v])){

		int to=G[v][i];

		if(to!=p){

			dfs1(to,v,t+1);

		}

	}

}

void dfs2(int v,int p,int t){

	dist2[v]=t;

	rep(i,SZ(G[v])){

		int to=G[v][i];

		if(to!=p){

			dfs2(to,v,t+1);

		}

	}

}

int main(){

    cin.sync_with_stdio(false);cin.tie(0);

	cin>>n;

	rep(i,n-1){

		int u,v;

		cin>>u>>v;

		G[u].push_back(v);

		G[v].push_back(u);

	}

	dfs1(1,-1,0);

	dfs2(n,-1,0);

//	for(int i=1;i<=n;i++){

//		cout<<dist1[i]<<' ';

//	}

//	cout<<endl;

//	for(int i=1;i<=n;i++){

//		cout<<dist2[i]<<' ';

//	}

//	cout<<endl;

	int cnt1=0,cnt2=0;

	for(int i=1;i<=n;i++){

		if(dist1[i]<=dist2[i])cnt1++;

		else cnt2++;

	}

	if(cnt1>cnt2)cout<<"Fennec"<<endl;

	else cout<<"Snuke"<<endl;

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 3.6189952720391676x):
#include <algorithm>

#include <bitset>

#include <cmath>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <deque>

#include <list>

#include <map>

#include <iomanip>

#include <iostream>

#include <queue>

#include <set>

#include <stack>

#include <string>

#include <utility>

#include <vector>

#define fi first

#define se second

#define pb push_back

//#define mp make_pair

#define rep(i,n) for(register int (i)=0;(i)<(n);(i)++)

using namespace std;

typedef long long LL;

typedef pair<int,int> pii;

const int INF=0x3f3f3f3f;

const int dx[]={0,1,-1,0},dy[]={1,0,0,-1};

//const int MOD=998244353;

const int N=2e5+10;



inline int read(){

	int ww=1,xx=0;char ch=getchar();

	while(!isdigit(ch)){if(ch=='-') ww=-ww;ch=getchar();}

	while(isdigit(ch)){xx=(xx<<1)+(xx<<3)+(ch^48);ch=getchar();}

	return ww*xx;

}



int n=read();

int head[N];

int cnt;

int dist1[N],dist2[N],ans;



struct Edge{

	int to,nxt;

}ed[N];



void add_edge(int a,int b){

	ed[++cnt].to=b;

	ed[cnt].nxt=head[a];

	head[a]=cnt;

}



void dfs1(int u,int p){

	for(int i=head[u];i!=-1;i=ed[i].nxt){

		int v=ed[i].to;

		if(v!=p){

			dist1[v]=dist1[u]+1;

			dfs1(v,u);

		}

	}

}



void dfs2(int u,int p){

	for(int i=head[u];i!=-1;i=ed[i].nxt){

		int v=ed[i].to;

		if(v!=p){

			dist2[v]=dist2[u]+1;

			dfs2(v,u);

		}

	}

}



signed main(){

//	freopen(".in","r",stdin);

//	freopen(".out","w",stdout);

	for(int i=1;i<=n;i++) head[i]=-1;

	for(int i=1;i<n;i++){

		int fr,to;

		fr=read();

		to=read();

		add_edge(fr,to);

		add_edge(to,fr);

	}

	dist1[1]=0;

	dist2[n]=0;

	dfs1(1,-1);

	dfs2(n,-1);

	for(int i=1;i<=n;i++)

		if(dist1[i]<=dist2[i])

			ans++;

	if(ans>n-ans) puts("Fennec");

	else puts("Snuke");

	return 0;

}

/*

7

3 6

1 2

3 1

7 4

5 7

1 4



4

1 4

4 2

2 3

*/