#include <bits/stdc++.h>
using namespace std;
#define int long long
using ll=long long;
using vi=vector<int>;
using vl=vector<long long>;
using pii=pair<int,int>;
using pll=pair<long long,long long>;
#define ITR(i,c) for(auto i=begin(c);i!=end(c);++i)
#define FORE(x,c) for(auto &x:c)
#define REPF(i,a,n) for(int i=a,i##len=(int)(n);i<i##len;++i)
#define REP(i,n) REPF(i,0,n)
#define REPR(i,n) for(int i=(int)(n);i>=0;--i)
#define REPW(i,n) for(i=0;i<(int)(n);++i)
#define ALL(c) begin(c),end(c)
#define RALL(c) rbegin(c),rend(c)   // c++14
#define SZ(c) ((int)c.size())
#define CONTAIN(c,x) (c.find(x)!=end(c))
#define OUTOFRANGE(y,x,h,w) (y<0||x<0||y>=h||x>=w)
#define dump(...)
const int DX[9]={0,1,0,-1,1,1,-1,-1,0},DY[9]={-1,0,1,0,-1,1,1,-1,0};
#define INF (1001001001)
#define INFLL (1001001001001001001ll)
template<class T> ostream& operator << (ostream &os,const vector<T> &v) {
    ITR(i,v) os << *i << (i==end(v)-1 ? "" : " "); return os; }
template<class T> istream& operator >> (istream &is,vector<T> &v) {
    ITR(i,v) is >> * i; return is; }
template<class T> istream& operator >> (istream &is, pair<T,T> &p) {
        is >> p.first >> p.second; return is; }
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return 1;}return 0;}
//------------------------------------------------------------------------------
struct before_main_function {
    before_main_function() {
        #ifdef int
            #undef INF
            #define INF INFLL
            #define stoi stoll
        #endif
        cin.tie(0);ios::sync_with_stdio(false);
        cout<<setprecision(15)<<fixed;
    }
} before_main_function;
//------------------8<------------------------------------8<--------------------

vector<vector<int>> g;
vector<bool> path;
vector<int> col;
bool dfs(int p,int v,int target) {
    bool ret=false;
    if(v==target) ret=true;
    FORE(x,g[v]) {
        if(x==p) continue;
        ret|=dfs(v,x,target);
    }
    if(ret) {
        path[v]=true;
    }
    return ret;
}
void dfs2(int v,int c) {
    FORE(x,g[v]) {
        if(col[x]==-1) {
            col[x]=c;
            dfs2(x,c);
        }
    }
}
signed main() {
    int n;
    cin>>n;
    g=vector<vector<int>>(n);
    path=vector<bool>(n,false);
    col=vector<int>(n,-1);
    REP(i,n-1) {
        int a,b;
        cin>>a>>b;
        a--,b--;
        g[a].push_back(b);
        g[b].push_back(a);
    }

    path[0]=true;
    path[n-1]=true;
    dfs(-1,0,n-1);

    int nf=0,ns=n-1;
    col[0]=0;
    col[n-1]=1;
    while(1) {
        bool ok=false;
        FORE(x,g[nf]) {
            if(path[x] && col[x]==-1) nf=x, ok=true;
        }
        if(!ok) break;
        col[nf]=0;

        ok=false;
        FORE(x,g[ns]) {
            if(path[x] && col[x]==-1) ns=x, ok=true;
        }
        if(!ok) break;
        col[ns]=1;
    }

    REP(i,n) {
        if(!path[i]) continue;
        if(col[i]==0) {
            dfs2(i,0);
        }
        else if(col[i]==1) {
            dfs2(i,1);
        }
    }
    dump(col);

    int F=0,S=0;
    REP(i,n) {
        if(col[i]==0) F++;
        if(col[i]==1) S++;
    }
    if(F>S) {
        cout<<"Fennec"<<endl;
    }
    else {
        cout<<"Snuke"<<endl;
    }
    return 0;
}


Measured memory_bytes: 12800