#ifdef LOCAL111
	#define _GLIBCXX_DEBUG
#else
	#define NDEBUG
#endif
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
const int INF = 1e9;
using namespace std;
template<typename T, typename U> ostream& operator<< (ostream& os, const pair<T,U>& p) { cout << '(' << p.first << ' ' << p.second << ')'; return os; }

typedef long long cost_t;

class Edge {
public:
	int to = -1;
	cost_t cost = -1;
	
	Edge(){
	}

	Edge(int x,cost_t y){
		to = x;
		cost = y;
	}

	// Edge(int x, int y, cost_t z){
	// 	// from = x;
	// 	to = y;
	// 	cost = z;
	// }

	// Edge(int x, int y, int r, cost_t z){
	// 	// from = x;
	// 	to = y;
	// 	cost = z;
	// 	// rev = r;
	// }

	bool operator< (const Edge& x) const {
		if(cost != x.cost) return cost < x.cost;
		return to < x.to;
	}

	bool operator> (const Edge& x) const {
		if(cost != x.cost) return cost > x.cost;
		return to > x.to;
	}
};

class Graph {
private:
	typedef vector<Edge> Edges;
	//const long long int INF = (long long)1e18;
	vector<Edges> v; 
	int n;
public:
	Graph(int x){
		n = x;
		v = vector<Edges>(x);
	}

	Graph(){}

	Edges& operator[](int x){
		return v[x];
	}

	const Edges& operator[](int x) const {
		return v[x];
	}

	int size() const {
		return n;
	}

	void add_edge(int from, const Edge &e){
		v[from].push_back(e);
	}

	void add_edge(int from, int to, cost_t cost = -1){
		add_edge(from,Edge(to,cost));
	}

	// void add_edge(int from, int to, cost_t cost = -1, int rev = -1){
	// 	add_edge(from,Edge(from,to,rev,cost));
	// }

	void add_uedge(int from, int to, cost_t cost = -1){
		add_edge(from,to,cost);
		add_edge(to,from,cost);
	}
};

vector<int> getTreePar(const Graph &g, int root)
{
	vector<int> par(g.size(),root);
	function<void(int p, int pre)> func = [&](int p, int pre){
		par[p] = pre;
		for(auto &e : g[p]){
			if(e.to != pre){
				func(e.to,p);
			}
		}
	};
	func(root,root);
	return par;
}

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#ifdef LOCAL111
	#define DEBUG(x) cout<<#x<<": "<<(x)<<endl
	template<typename T> void dpite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
#else
	#define DEBUG(x) true
	template<typename T> void dpite(T a, T b){ return; }
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge)+1 << ": "
template<typename T> void pite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}

typedef long long int LL;
typedef unsigned long long ULL;
typedef pair<int,int> P;

class GraphVizualizer{
	int cnt;
public:
	GraphVizualizer(){
		cnt = 0;
	}

	void operator() (const Graph &g, bool with_dir = true, bool with_cap = false){
		ofstream ofs("./out.dot");
		if(!with_dir) ofs << "graph graph_name {" << endl;
		else ofs << "digraph graph_name {" << endl;
		for(int i = 0; i < (int)g.size(); ++i) {
			ofs << "    " << i << "[];" << endl;
		}
		for(int i = 0; i < (int)g.size(); i++){
			if (!g[i].size())
				continue;
			for(const auto &e : g[i]){
				if(!with_dir){
					if(e.to > i) ofs << "    " << i << " -- " << e.to ; 
				}else ofs << "    " << i << " -> " << e.to ; 
				
				if (with_cap) {
					ofs << " [ label = \"" << (e.cost  == INF ? "inf" : to_string(e.cost)) << "\"];"; 
				}
				if(with_dir or e.to > i)ofs << endl;
			}
		}
		ofs << "}" << endl;
		ofs.close();
		string cmd = "dot -T png out.dot > ";
		cmd = cmd+"sample"+to_string(cnt)+".png";
		system(cmd.c_str());	
		cnt++;
	}
};

void ios_init(){
	//cout.setf(ios::fixed);
	//cout.precision(12);
#ifdef LOCAL111
	return;
#endif
	ios::sync_with_stdio(false); cin.tie(0);	
}

int main()
{
	ios_init();
	int n;
	// GraphVizualizer viz;
	while(cin >> n) {
		Graph g(n);
		REP(i,n-1){
			int a, b;
			cin >> a >> b;
			a--; b--;
			g.add_uedge(a,b);
		}
		// viz(g);
		auto par = getTreePar(g, 0);	
		vector<int> pa;
		pa.push_back(n-1);
		int p = n-1;
		while(p != 0) {
			p = par[p];
			pa.push_back(p);
		}
		int num = SZ(pa)-2;
		set<int> s(ALL(pa));
		function<int(int,int)> dfs = 
		[&](int p, int pre) -> int {
			DEBUG(p);
			int res = 1;
			for(auto&& e : g[p]) {
				if(e.to != pre and !s.count(e.to)){
					res += dfs(e.to, p);
				}
			}
			return res;
		};
		reverse(ALL(pa));
		int se = 0;
		REP(i,(SZ(pa)+1)/2){
			DEBUG(pa[i]);
			se += dfs(pa[i],-1)-1;
		}
		DEBUG(endl);
		int ko = 0;
		FOR(i,(SZ(pa)+1)/2,SZ(pa)){
			DEBUG(pa[i]);
			ko += dfs(pa[i],-1)-1;
		}
		DEBUG(se); DEBUG(ko);
		int turn = -100;
		if(num%2 == 0){
			turn = 0;
		}else{
			turn = 1;
		}
		bool ans = true;
		while(true){
			if(turn){
				if(ko == 0){
					ans = true;
					break;
				}
				ko--;
			}else{
				if(se == 0){
					ans = false;
					break;
				}
				se--;
			}
			turn = !turn;
		}
		cout << (ans ? "Fennec" : "Snuke") << endl;
	}
	return 0;
}


Measured memory_bytes: 19068