#include <bits/stdc++.h>
using namespace std;

int n, x, y;
vector <int> tree [100005];
int memo[100005];

int main () {
	
	int i=0;

	scanf("%d", &n);

	for (i=0; i<n-1; i++) {
		scanf("%d %d", &x, &y);
		x--; y--;
		tree[x].push_back(y);
		tree[y].push_back(x);
	}

	
	queue <pair<int, int> > q;
	memo[0] = 1;
	memo[n-1] = 1;
	q.push(make_pair(0, 1));
	q.push(make_pair(n-1, 2));

	int f=1, s=1;

	while (!q.empty()) {

		int u = q.front().first;
		int play = q.front().second;
		q.pop();

		for (i=0; i<tree[u].size(); i++) {
			int v = tree[u][i];
			if (memo[v] == 0) {
				q.push(make_pair(v, play));
				memo[v] = play;
				if (play == 1) f++;
				else s++;
			}
		}
	}




	if (f==s) printf("Snuke\n");
	else {
		if (f>s) printf("Fennec\n");
		else printf("Snuke\n");
	}
	
	return 0;
}