#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <utility>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <ctime>
#include <cctype>
#include <cstdlib>
#include <numeric>
#define IINF 1000000000
#define INF 9223372036854775807
#define MOD 1000000007
#define mod 1000000007
#define INT_MAX_ 2147483647
#define EPS (1e-10)
#define REP(i, a, n) fo-r (ll i = a; i < (ll)(n); i++)
#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)
//#define rep(i,n)for (ll i = 0; i < (ll)(n); i++)
#define rep(i,l,r)for(ll i=(l);i<(r);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define mmax(x,y)(x>y?x:y)
#define mmin(x,y)(x<y?x:y)
#define chmax(x,y) x=mmax(x,y)
#define chmin(x,y) x=mmin(x,y)
#define all(x) (x).begin(),(x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
#define me memset
#define bit(n,k) ((n>>k)&1)
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<int,int>Pin;
typedef pair<ll,ll>Pll;
template<class T> using V=vector<T>;
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T> >;
long long GCD(long long a, long long b) {return b?GCD(b,a%b):a;}
long long LCM(long long a, long long b) {return a/GCD(a,b)*b;}
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
int ddx[8]={-1,0,1,0,1,1,-1,-1};
int ddy[8]={0,-1,0,1,1,-1,1,-1};
ll cmp1(pair<ll,ll> a,pair<ll,ll> b){
        if(a.fi!=b.fi)
        return a.fi<b.fi;
        else
        return a.se>b.se;
}
//----------------------------------------------------------------------
bool color1[100010],color2[100010];
ll d1[100010],d2[100010];
//----------------------------------------------------------------------
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    //-------------------------------  
    //ll begin_t=clock();
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    //------------------------------
    ll n;cin>>n;
    V<ll>G[100010];
    for(ll i=0;i<n-1;i++){
        ll a,b;cin>>a>>b;
        a--;b--;
        G[a].pb(b);
        G[b].pb(a);
    }
    ll sum1=0,sum2=0;
    queue<Pll>Q1,Q2;
    
    Q1.push(mp(0,0));
    color1[0]=1;
    while(!Q1.empty()){
        Pll now = Q1.front();Q1.pop();
        ll p = now.fi, dn= now.se;
        d1[p]=dn;
        for(ll i=0;i<G[p].size();i++){
            if(color1[G[p][i]]==0){
                color1[G[p][i]]=1;
                Q1.push(mp(G[p][i],dn+1));
            }
        }
    }

    Q2.push(mp(n-1,0));
    color2[n-1]=1;
    while(!Q2.empty()){
        Pll now = Q2.front();Q2.pop();
        ll p = now.fi, dn= now.se;
        d2[p]=dn;
        //cout<<p<<endl;
        //cout<<G[p].size()<<Endl;
        for(ll i=0;i<G[p].size();i++){
            //cout<<G[p][i]<<" "<<color[G[p][i]]<<endl;
            if(color2[G[p][i]]==0){
                color2[G[p][i]]=1;
                Q2.push(mp(G[p][i],dn+1));
            }
        }
    }
    for(ll i=0;i<=n-1;i++){
        //cout<<d1[i]<<" "<<d2[i]<<endl;
        if(d1[i]<=d2[i])sum1++;
        else sum2++;        
    }
    //cout<<sum1<<" "<<sum2<<endl;
    if(sum1>sum2){
        cout<<"Fennec"<<endl;
    }
    else cout<<"Snuke"<<endl;
    //------------------------------
    //fclose(stdin);
    //fclose(stdout);
    //ll end_t=clock();cout<<"time="<<end_t-begin_t<<"ms"<<endl;
    //------------------------------- 
    return 0;
}
//----------------------------------------------------------------------






































Measured memory_bytes: 11708