#include <iostream>

#include <string>

#include <cstdio>

#include <cmath>

#include <cstring>

#include <algorithm>

#include <vector>

#include <queue>

#define range(i,a,b) for(int i=a;i<=b;++i)

#define LL long long

#define rerange(i,a,b) for(int i=a;i>=b;--i)

#define fill(arr,tmp) memset(arr,tmp,sizeof(arr))

using namespace std;

int n,x,y,col[],cnt[];

vector<int> map[];

void init(){

    cin>>n;

    range(i,,n-){

        cin>>x>>y;

        map[x].push_back(y);

        map[y].push_back(x);

    }

    col[]=,col[n]=;

}

void solve(){

    queue<int>q;

    q.push(),q.push(n);

    while(!q.empty()){

        int head=q.front();

        q.pop();

        ++cnt[col[head]];

        range(i,,map[head].size()-){

            int tmp=map[head][i];

            if(col[tmp])continue;

            col[tmp]=col[head];

            q.push(tmp);

        }

    }

    cout<<(cnt[]<cnt[]?"Fennec":"Snuke")<<endl;

}

int main() {

    init();

    solve();

    return ;

}