#include"bits/stdc++.h"

using namespace std; 

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
typedef priority_queue<LL> PQ_DESC;
typedef priority_queue<LL, VL, greater<LL>> PQ_ASC;
typedef priority_queue<PII> PQ_DESC_PII;
typedef priority_queue<PII, vector<PII>, greater<PII>> PQ_ASC_PII;
typedef priority_queue<VL> PQ_DESC_VL;
typedef priority_queue<VL, vector<VL>, greater<VL>> PQ_ASC_VL;
typedef priority_queue<PLL> PQ_DESC_PLL;
typedef priority_queue<PLL, vector<PLL>, greater<PLL>> PQ_ASC_PLL;

#define ALL(c) (c).begin(),(c).end()
#define PB push_back
#define MP make_pair
#define SORT_ASC(c) sort(ALL(c))
//#define SORT_DESC(c) sort(ALL(c), greater<typeof(*((c).begin()))>())
#define SORT_DESC(c) sort((c).rbegin(),(c).rend())
#define REV(c) reverse((c).begin(), (c).end())
#define SIZE(a) int((a).size())

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define ROF(i,a,b) for(int i=(b-1);i>=(a);--i)
#define REP(i,n) FOR(i,0,n)
#define PER(i,n) ROF(i,0,n)

const double EPS = 1e-10;
const double PI  = acos(-1.0);
const int LARGE_INT = 1e9+100;
const int INF = 2e9+100;
const LL INF_LL = (LL)INF*(LL)INF;
const int MOD = 1e9+7;

//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

LL modpow(LL a, LL n) {
    LL res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % MOD;
        a = a * a % MOD;
        n >>= 1;
    }
    return res;
}

void Main()
{
    int n;cin>>n;
    VVL e(n);
    REP(i,n-1){
        LL a,b;cin>>a>>b;
        a--;b--;
        e[a].PB(b);
        e[b].PB(a);
    }

    VL back(n,-2);
    back[0] = -1;
    queue<LL> q;
    q.push(0);

    while(!q.empty()){
        LL now = q.front();
        q.pop();

        if(now == n-1){
            break;
        }

        for(auto next : e[now]){
            if(back[next] != -2){
                continue;
            }
            back[next] = now;
            q.push(next);
        }
    }

    deque<LL> dq;
    LL tnow = n-1;

    dq.push_front(tnow);

    while(tnow != 0){
        tnow = back[tnow];
        dq.push_front(tnow);
    }

    //for(auto x : dq){
    //    cerr<<x<<" ";
    //}
    //cerr<<endl;


    VL color(n);
    const int BLACK = 1;
    const int WHITE = 2;
    //color[0] = BLACK;
    //color[n-1] = WHITE;


    while(true){
        if(dq.empty()){
            break;
        }
        LL now = dq.front();
        dq.pop_front();
        color[now] = BLACK;

        if(dq.empty()){
            break;
        }
        now = dq.back();
        dq.pop_back();
        color[now] = WHITE;
    }

    queue<LL> bq;
    queue<LL> wq;
    REP(i,n){
        if(color[i] == BLACK){
            bq.push(i);
        }
        if(color[i] == WHITE){
            wq.push(i);
        }
    }

    while(!bq.empty()){
        LL now = bq.front();
        bq.pop();

        for(auto next : e[now]){
            if(color[next] != 0){
                continue;
            }
            color[next] = BLACK;
            bq.push(next);
        }
    }
    
    while(!wq.empty()){
        LL now = wq.front();
        wq.pop();

        for(auto next : e[now]){
            if(color[next] != 0){
                continue;
            }
            color[next] = WHITE;
            wq.push(next);
        }
    }

    LL count_black = 0;
    LL count_white = 0;

    for(auto c : color){
        if(c == BLACK){
            count_black++;
        }
        else{
            count_white++;
        }
    }

    if(count_black>count_white){
        cout<<"Fennec"<<endl;
    }
    else{
        cout<<"Snuke"<<endl;
    }


    
    
	return;
}

int main()
{
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	cout << fixed << setprecision(15);
	Main();
    return 0;
}

Measured memory_bytes: 11156