#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int n;
vector< vector< int > > g(100001);

vector< int > used(100001, -1);

void rec(int p, int c) {
    used[p] = c;
    for(int i = 0; i < g[p].size(); i++) {
        if(used[g[p][i]] == -1) {
            rec(g[p][i], c + 1);
        }
    }
}

int main() {

    cin >> n;
    for(int i = 0; i < n - 1; i++) {
        int a, b; cin >> a >> b;
        g[a].push_back(b);
        g[b].push_back(a);
    }

    vector< int > s1, s2;
    rec(n, 0);
    s1 = used;
    used = vector< int > (100001, -1);
    rec(1, 0);
    s2 = used;

    int sum1 = 0, sum2 = 0;
    for(int i = 1; i <= n; i++) {
        if(s1[i] < s2[i]) sum1++;
        else sum2++;
    }
    cout << (sum1 >= sum2 ? "Snuke" : "Fennec") << endl;
}
