#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>

typedef char                SINT8;
typedef unsigned char       UINT8;
typedef short               SINT16;
typedef unsigned short      UINT16;
typedef int                 SINT32;
typedef unsigned int        UINT32;
typedef long long           SINT64;
typedef unsigned long long  UINT64;
typedef double              DOUBLE;

#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
#define ABS(a) ((a)>(0)?(a):-(a))
#define rep(i,a,b) for(int (i)=int(a);(i)<int(b);(i)++)
#define mrep(i,a,b) for(int (i)=int(a);(i)>=int(b);(i)--)

#define INF 1000000001
#define MOD 1000000007
#define INF64 1000000000000000001

#define F first
#define S second

#define Pii pair<SINT32,SINT32>
#define Pll pair<SINT64,SINT64>


using namespace std;

int main() {

	SINT32 N = 0;
	SINT32 Acnt = 0;
	SINT32 Bcnt = 0;
	cin >> N;
	N--;

	vector<pair<SINT32,SINT32>> DATA(N*2);

	vector<SINT32> none(N+1);

	rep(i,0,N*2) {
		cin >> DATA[i].F;
		cin >> DATA[i].S;
		DATA[i].F--;
		DATA[i].S--;
		i++;
		DATA[i].F = DATA[i-1].S;
		DATA[i].S = DATA[i-1].F;
	}
	sort(DATA.begin(),DATA.end());

	queue<SINT32> fi;
	queue<SINT32> se;

	fi.push(0);
	none[0] = 1;
	se.push(N);
	none[N] = 2;

	SINT32 fict1 = 1;
	SINT32 fict2 = 0;
	SINT32 sect1 = 1;
	SINT32 sect2 = 0;

	while((fi.size() != 0) || (se.size() != 0)) {
		while (fict1 != 0) {
			fict1--;
			SINT32 posi;
			SINT32 p = fi.front();
			fi.pop();
			
			posi = lower_bound(DATA.begin(),DATA.end(),make_pair(p,-INF)) - DATA.begin();

			rep(i,posi,N*2) {
				if (DATA[i].F != p) {
					break;
				}
				if (none[DATA[i].S] == 0) {
					none[DATA[i].S] = 1;
					fi.push(DATA[i].S);
					Acnt++;
					fict2++;
				}
			}
		}
		fict1 = fict2;
		fict2 = 0;

		while (sect1 != 0) {
			sect1--;
			SINT32 posi;
			SINT32 p = se.front();
			se.pop();
			
			posi = lower_bound(DATA.begin(),DATA.end(),make_pair(p,-INF)) - DATA.begin();

			rep(i,posi,N*2) {
				if (DATA[i].F != p) {
					break;
				}
				if (none[DATA[i].S] == 0) {
					none[DATA[i].S] = 2;
					se.push(DATA[i].S);
					Bcnt++;
					sect2++;
				}
			}
		}
		sect1 = sect2;
		sect2 = 0;
	}

/*
	cout << Acnt << endl;
	cout << Bcnt << endl;


	rep(i,0,N*2) {
		cout << DATA[i].F << " ";
	}
	cout << endl;
	rep(i,0,N*2) {
		cout << DATA[i].S << " ";
	}
	cout << endl;

	rep(i,0,N+1) {
		cout << none[i] << " ";
	}
	cout << endl;
*/

	if (Acnt > Bcnt) {
		cout << "Fennec" << endl;
	} else {
		cout << "Snuke" << endl;
	}
	return 0;
}

//	sort(DATA.begin(),DATA.end());
//	sort(DATA.begin(),DATA.end(),std::greater<SINT32>());
//	__gcd(ANS,DATA[i]);

//	// DATA.emplace_back(BUF);	//後ろに追加

//  DATA.erase(std::unique(DATA.begin(), DATA.end()), DATA.end());	//ソート後に使用

//	DATA.insert(DATA.begin() + X, 0);	//X番目の要素に0を挿入


//	vector<vector<SINT32>> DP(N,vector<SINT32>(3));	//2次元配列

/*
	SINT32 M = 3;
	vector<pair<SINT32,SINT32>> DATA2(M);
	for (SINT32 i = 0; i < M; i++) {
		cin >> DATA2[i].first;
		cin >> DATA2[i].second;
	}
	sort(DATA2.begin(),DATA2.end());
	cout << DATA2[0].first << endl;
	cout << DATA2[0].second << endl;
*/

// 	vector<pair<int,pair<int,int>>> DATA(M);
//	cin >> DATA[i].first;
//	cin >> DATA[i].second.first;
//	cin >> DATA[i].second.second;


//		APOSI = lower_bound(ADATA.begin(),ADATA.end(),QDATA[i]) - ADATA.begin();	//key以上を探す
//		BPOSI = lower_bound(BDATA.begin(),BDATA.end(),QDATA[i]) - BDATA.begin();


/* 文字列回転
	string N;
	cin >> N;
	N = N[N.length()-1] + N.substr(0,N.length()-1);
*/
/* 文字列合成
	string N,M;
	cin >> N >> M;
	SINT64 ans = 0;
	ans = stoi(N+M);
*/

/*
//ワーシャルフロイド
vector<vector<SINT32>> dist(N,vector<SINT32>(N));
rep(i,0,N) {
	rep(j,0,N) {
		if (i != j) {
			dist[i][j] = INF;
		}
	}
}
rep(k,0,N) {
	rep(i,0,N) {
		rep(j,0,N) {
			dist[i][j] = MIN(dist[i][j], dist[i][k]+dist[k][j]);
		}
	}
}
*/



/* SET コンテナ
	set<SINT32> DATA;
	for (SINT32 i = 0; i < N; i++) {
		SINT32 buf;
		cin >> buf;
		DATA.insert(buf);
	}

	//全表示
    set<string>::iterator it; //  イテレータを用意
    for(it = DATA.begin(); it != DATA.end(); it++) {
        cout << *it << endl;
    }

	//N番目を一部表示
	set<string>::iterator it; //  イテレータを用意
	it = DATA.begin();
	rep (i,0,N) {
		it++;
	}
	cout << *it << endl;
*/

/* map
	map<string,SINT32> mp;
	SINT32 N = 0;
	SINT32 mx = 0;

	cin >> N;
	for (SINT32 i = 0; i < N; i++) {
		string s;
		cin >> s;
		mp[s]++;
	}
	for(auto it=mp.begin();it!=mp.end();it++) {
		mx=max(mx,it->second);
	}
*/

/*
	//順列全表示
	//sortしてからでないと全列挙にならない
	sort(DATA.begin(),DATA.end());
	do {
		cout << buf << endl;
		rep(i,0,R) {
			cout << DATA[i] << " ";
		}
		cout << endl;

    } while (next_permutation(DATA.begin(),DATA.end()));
*/

Measured memory_bytes: 2176