import std.stdio, std.conv, std.string;
import std.algorithm, std.array, std.container, std.typecons;
import std.numeric, std.math;
import core.bitop;

T RD(T = long)() { static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }
T[] ARR(T)(in string str, T fix = 0) { auto r = str.split.to!(T[]); r[] += fix; return r; }
size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

bool INSIDE(T)(T x, T b, T e) { return x >= b && x < e; }

long mod = pow(10, 9) + 7;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

struct UnionFind
{
	void init(long n) { par = new long[](n); foreach (i; 0..n) par[i] = i; }
	long root(long i) { return par[i] == i ? i : (par[i] = root(par[i])); }
	bool same(long i, long j) { return root(i) == root(j); }
	void unite(long i, long j) { i = root(i); j = root(j); if (i == j) return; par[i] = j; }
	long[] par;
}

long[] dijkstra(long from, long to, long[][] edges)
{
	long[] path;
	auto cost = new long[](edges.length); fill(cost, long.max); cost[from] = 0;
	long[][] open = [[from]];
	while (!open.empty)
	{
		auto n = open.front; open.popFront;
		auto p = n[0];
		foreach (i; 0..edges.length)
		{
			if (edges[p][i] == -1) continue;
			auto c = cost[p] + edges[p][i];
			if (c < cost[to] && c < cost[i]) { cost[i] = c; if (i == to) path = i ~ n; else open ~= i ~ n; }
		}
	}
	return cost[to] ~ path;
}

void main()
{
	auto N = RD!long;

	auto v = new long[][](N+1);
	auto v2 = new long[][](N+1);
	foreach (i; 0..N-1)
	{
		auto a = RD;
		auto b = RD;
		v[a] ~= b;
		v[b] ~= a;
		v2[a] ~= b;
		v2[b] ~= a;
	}
	auto score = new long[](N+1);
	fill(score, 1);
	foreach (i, e; v)
	{
		if (e.length != 1) continue;
		long pos = i, lastPos = -1;
		long s;
		while (v[pos].length <= 2 && pos != 1 && pos != N)
		{
			s          += score[pos];
			auto newPos = v[pos][0] == lastPos ? v[pos][1] : v[pos][0];
			lastPos     = pos;
			pos         = newPos;
		}
		score[pos] += s;
		if (lastPos != -1)
			v[pos] = remove!(a => a == lastPos)(v[pos]);
	}
	stderr.writeln(score);

	auto used = new long[](N+1);
	used[0] = used[N] = 1;
	long pos1 = 1, pos2 = N;
	long lastPos1 = -1, lastPos2 = -1;
	long s1 = score[1], s2 = score[N];
	while (true)
	{
		stderr.writeln(pos1, " ", pos2);
		{
			auto newPos = v[pos1][0] == lastPos1 ? v[pos1][1] : v[pos1][0];
			if (used[newPos] == 1) break;
			lastPos1    = pos1;
			pos1        = newPos;
			s1         += score[pos1];
			used[pos1]  = 1;
		}
		stderr.writeln("mid");
		{
			auto newPos = v[pos2][0] == lastPos2 ? v[pos2][1] : v[pos2][0];
			if (used[newPos] == 1) 
			{
				--s2;
				break;
			}
			lastPos2    = pos2;
			pos2        = newPos;
			s2         += score[pos2];
			used[pos2]  = 1;
		}
	}
	stderr.writeln(s1, ":", s2);

	writeln(s1 > s2 ? "Fennec" : "Snuke");
	stdout.flush();
}

Measured memory_bytes: 20220