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

 *   I<3   C++   *

 *  IWANT ANYAC  *

 * ILOVEPROGRAM! *

 *IT'SINTERESTING*

 * ILOVEPROGRAM! *

 *  INCONTESTS   *

 *   GETSCORE    *

 *    ACCODE     *

 *     LETS      *

 *      GO       *

 *****************/

#include <algorithm>

#include <bitset>

#include <cassert>

#include <cctype>

#include <cmath>

#include <complex>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <ctime>

#include <deque>

#include <fstream>

#include <functional>

#include <iomanip>

#include <iostream>

#include <list>

#include <map>

#include <numeric>

#include <queue>

#include <set>

#include <sstream>

#include <stack>

#include <string>

#include <utility>

#include <vector>

#define LL long long

#define pb push_back

#define pob pop_back

#define mp make_pair

#define FILL(a,v) memset((void*)a,v,sizeof(a))

#define FILL0(a) FILL(a,0)

#define FILL1(a) FILL(a,-1)

#define ALL(a) (a).begin(),(a).end()

#define Inf 1e9

#define Mod 1000000007

#define foreach(it,x) for(typeof(x.begin()) it=x.begin();it!=x.end();it++)

#define FOR(i,x) for(int i=0;i<x;i++)

#define RFOR(i,x) for(int i=x-1;i>=0;i--)

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

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

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

#define FI first

#define SE second

#define OVER(a) return puts(a),0

#define fastio ios::sync_with_stdio(0)

#define filei(f) freopen(f,"r",stdin)

#define fileo(f) freopen(f,"w",stdout)

#define MASK(a) (1<<(a))

#define MASKX(x,a) ((x)<<(a))

#define BIT(a,b) ((a>>b)&1)

using namespace std;

typedef pair<int,int> pii;

typedef unsigned long long UINT;

typedef unsigned int Uint;

typedef long long INT;

typedef pair<INT,INT> PII;

typedef stringstream sst;

typedef istringstream iss;

typedef vector<int> vint;

typedef vector<INT> VINT;

typedef vector<pii> vpii;

typedef vector<PII> VPII;

typedef priority_queue<int> pqi;

typedef priority_queue<INT> PQI;

typedef priority_queue<pii> pqp;

typedef priority_queue<PII> PQP;

typedef priority_queue<int,vint,greater<int> > xqi;

typedef priority_queue<INT,VINT,greater<INT> > XQI;

typedef priority_queue<pii,vpii,greater<pii> > xqp;

typedef priority_queue<PII,VPII,greater<PII> > XQP;



int n;

int a,b;

int cnt1,cnt2;



vint bfs(int b,vector<vint> nei)

{

	vint bss(n);

	queue<int> q,bs;

	set<int> lgl;

	q.push(b);

	bs.push(0);

	lgl.insert(b);

	bss[b]=0;

	while(!q.empty())

	{

		int qq=q.front(),bb=bs.front();

		q.pop();bs.pop();

		for(int i=0;i<SZ(nei[qq]);i++)

		{

			int ii=nei[qq][i];

			if(!lgl.count(ii))

			{

				lgl.insert(ii);

				q.push(ii);

				bs.push(bb+1);

				bss[ii]=bb+1;

			}

		}

	}

	return bss;

}



int main()

{

	scanf("%d",&n);

	vector<vint> nei(n);

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

	{

		scanf("%d%d",&a,&b);

		nei[a-1].push_back(b-1);

		nei[b-1].push_back(a-1);

	}

	vint v1=bfs(0,nei);

	vint v2=bfs(n-1,nei);

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

		if(v1[i]<=v2[i])cnt1++;

		else cnt2++;

	if(cnt1>cnt2)OVER("Fennec");

	else OVER("Snuke");

}

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

#define N 100005

int n;

struct edge{

    int to,next;

}e[N<<1];

int head[N],cnt;

void add(int u,int v){

    e[++cnt]=(edge){v,head[u]};

    head[u]=cnt;

}

int son[N];

int path[N],len;

bool dfs(int x,int fa){

    bool p=x==n;

    for(int i=head[x];i;i=e[i].next){

        int v=e[i].to;

        if(v==fa)continue;

        p|=dfs(v,x);

    }

    son[fa]+=son[x]+1;

    if(p){

        path[++len]=x;

        return true;

    }

    return false;

}

int main(){

    scanf("%d",&n);

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

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

        add(u,v);add(v,u);

    }

    dfs(1,0);

    int ans=0;

    for(int i=len;i>len/2;--i)

        ans+=son[path[i]]-son[path[i-1]];

    printf("%s\n",ans*2>n?"Fennec":"Snuke");

    return 0;

}