// Slower C++ solution:
/////////////////////////////////////////

////////// ^\/^ *_* :) :-D '~' \\\\\\\\\\

/////////////////////////////////////////

#include <bits/stdc++.h>

//#include <algorithm>

//#include <cstdio>

//#include <functional>

#include <iostream>

//#include <cfloat>

//#include <climits>

//#include <cstdlib>

//#include <cstring>

//#include <cmath>

//#include <map>

//#include <queue>

//#include <set>

//#include <sstream>

//#include <stack>

//#include <string>

//#include <time.h>

//#include <vector>

//#include <random>

//#include <unordered_set>

//#include <complex>

//#include <string.h>



#define rt0 return 0

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

#define repn(i,n) for(int i=1;i<=n;i++)

#define LL long long

#define pii pair<int,int>

#define pb push_back

#define fi first

#define se second

#define mpr make_pair



using namespace std;



const LL MOD=1e9+7;

int n,dist[100010],dist2[100010];

vector <int> g[100010];



int main()

{

	cin>>n;

	rep(i,n-1)

	{

		int x,y;

		cin>>x>>y;

		g[x].pb(y);

		g[y].pb(x);

	}

	memset(dist,1,sizeof(dist));

	memset(dist2,1,sizeof(dist2));

	queue <int> q;

	dist[1]=0;

	q.push(1);

	while(!q.empty())

	{

		int t=q.front();

		q.pop();

		rep(i,g[t].size())

		{

			if(dist[g[t][i]]!=16843009) continue;

			else

			{

				dist[g[t][i]]=dist[t]+1;

				q.push(g[t][i]);

			}

		}

	}

	queue <int> q1;

	dist2[n]=0;

	q1.push(n);

	while(!q1.empty())

	{

		int t=q1.front();

		q1.pop();

		rep(i,g[t].size())

		{

			if(dist2[g[t][i]]!=16843009) continue;

			else

			{

				dist2[g[t][i]]=dist2[t]+1;

				q1.push(g[t][i]);

			}

		}

	}

	int fen=0,snu=0;

	repn(i,n)

	{

		if(dist[i]<=dist2[i]) fen++;

		else snu++;

	}

	if(fen>snu) puts("Fennec");

	else puts("Snuke");

	rt0;

}

// Faster C++ solution for the same problem (measured speedup: 1.2411848634334623x):
#include <bits/stdc++.h>

using namespace std;

typedef long long LL;

typedef vector<int> VI;

typedef pair<int, int> pii;

#define rep(i, a, b) for(int i = int(a); i <= int(b); ++i)

#define per(i, b, a) for(int i = int(b); i >= int(a); --i)

#define SZ(x) x.size()

#define mk make_pair

#define pb push_back

#define fi first

#define se second

const LL INF = 1e18;

const int inf = 0x3f3f3f3f;

const int mod = 1e9 + 7;

const int N = 1e5 + 10;

LL qpow(LL x, LL y, LL MOD) {LL a=1; while(y){ if(y&1) a=a*x%MOD; x=x*x%MOD; y>>=1; } return a;}



vector<int> G[N];

int dis[N], sz[N], pre[N];

int cnt[N], tot;



void dfs(int u, int fa) {

    sz[u] = 1;

    for(auto v : G[u]) {

        if(v == fa) continue;

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

        pre[v] = u;

        dfs(v, u);

        sz[u] += sz[v];

    }

}



int main() {

    int n;

    scanf("%d", &n);

    rep(i, 1, n-1) {

        int u, v;

        scanf("%d%d", &u, &v);

        G[u].pb(v), G[v].pb(u);

    }

    dfs(1, -1);

    int cur = n;

    tot = 0;

    while(pre[cur] != 1) {

        cnt[tot++] = sz[pre[cur]]-sz[cur];

        cur = pre[cur]; 

    }

    int x = n-sz[cur]-1, y = sz[n]-1;

    int l = 0, r = tot-1, tp = 0;

    while(l <= r) {

        if(!tp) {

            x += cnt[r];

            r--;

        } else {

            y += cnt[l];

            l++;

        }

        tp ^= 1;

    }

    if(x > y) puts("Fennec");

    else puts("Snuke");



    return 0;

}