// g++ macro.cpp -std=c++14
#include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using namespace std;
 
#define dump(x)  cout << #x << " = " << (x) << endl;
#define YES(n) cout << ((n) ? "YES" : "NO"  ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No"  ) << endl
 
#define SANKOU(n,a,b) cout << ((n) ? (#a) : (#b) ) << endl
 
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
 
#define FOREACH(x,a) for(auto& (x) : (a) )
 
#define WFA(d,v) REP(k,v)REP(i,v)REP(j,v)d[i][j]=min(d[i][j],d[i][k]+d[k][j])
 
#define SCOUT(x) cout<<(x)<<" "
#define ENDL cout<<endl
 
#define VECCIN(x) for(auto&youso_: (x) )cin>>youso_
#define VECIN2(x,y) REP(i,x.size())cin>>x[i]>>y[i]
#define VECCOUT(x) for(auto&youso_: (x) )cout<<youso_<<" ";cout<<endl
 
#define ALL(obj) (obj).begin(),(obj).end()
 
#define EXIST(n,x) (find(ALL(n),x)!=n.end())
#define UNIQUE(obj) sort(ALL( obj )); obj.erase(unique(ALL(obj)),obj.end())
#define COUT(x) cout<<(x)<<endl
void CINT(){}
template <class Head,class... Tail>
void CINT(Head&& head,Tail&&... tail){
    cin>>head;
    CINT(move(tail)...);
}
#define CIN(...) int __VA_ARGS__;CINT(__VA_ARGS__)
#define SCIN(...) string __VA_ARGS__;CINT(__VA_ARGS__)
 
// #include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision; // cpp_int
 
#define P pair<int,int>
#define V vector<int>
#define M map<int,int>
#define S set<int>
#define L list<int>
 
#define pb(a) push_back(a)
#define mp make_pair
 
class UnionFind{
public:
    V par,rank;// parent,rank
    UnionFind(int n);
    int Find(int x);
    void Unite(int x,int y);
    bool Same(int x,int y);
};
UnionFind::UnionFind(int n){
    par.resize(n);rank.resize(n);
    REP(i,n){par[i]=i;rank[i]=0;}
}
int UnionFind::Find(int x){
    
    return (par[x]==x?x:Find(par[x]));
}
void UnionFind::Unite(int x,int y){
    x=Find(x);y=Find(y);//parent
    
    if(x==y)return;//end
    if(rank[x]<rank[y])par[x]=y;
    else{
        par[y]=x;
        if(rank[x]==rank[y])rank[x]++;
    }
}
bool UnionFind::Same(int x,int y){
    return (Find(x)==Find(y));
}
 
class Dijkstra{
public:
    Dijkstra(vector<M> ed,int firs,int pnum);
    void Solve();
    V range;// range[a]=b;
    vector<M> edges;// [a][b]=c;
    priority_queue<P,vector<P>,greater<P>> que;// queue=(range,point);
    V keiro;
    V CalcRoute(int startp,int endp);
};
 
Dijkstra::Dijkstra(vector<M> ed,int firs,int pnum){
    edges=ed;
    V ttt(pnum,INF);
    range=ttt;
    range[firs]=0;
    que.push(mp(0,firs));
    keiro=V(pnum);
    REP(i,pnum)keiro[i]=i;
}
 
void Dijkstra::Solve(){
    while(!que.empty()){
        P top_=que.top();
        que.pop();
        FOREACH(x,edges[top_.second]){
            if(range[x.first] > range[top_.second] + x.second){
                range[x.first] = range[top_.second] + x.second;
                que.push(mp(range[x.first],x.first));
                keiro[x.first] = top_.second;
            }
        }
    }
}
 
V Dijkstra::CalcRoute(int startp,int endp){
  V vec(1,endp);
  int point = endp;
  while(!point==startp){
    point = keiro[point];
    vec.pb(point);
  }
  return vec;
}
 
 
int main(){
  
  CIN(n);
  V a(n-1);V b(n-1);VECIN2(a,b);
  REP(i,n-1){a[i]--;b[i]--;}
  vector<M> edges(n);
  REP(i,n-1){edges[a[i]][b[i]]=1;edges[b[i]][a[i]]=1;}
 
  Dijkstra dijk(edges,0,n);dijk.Solve();
  V route = dijk.CalcRoute(0,n-1);
 
  reverse(ALL(route));
  int st = route[(route.size()-1)/2];
  int en = route[(route.size()-1)/2+1];
 
  REP(i,n-1)if((a[i]==st&&b[i]==en)||(a[i]==en&&b[i]==st))b[i]=a[i]; 
  UnionFind uni(n);
  REP(i,n-1)uni.Unite(a[i],b[i]);
  int blcou=0;int whcou=0;
  REP(i,n)(uni.Same(0,i)?blcou:whcou)++;
  SANKOU(blcou>whcou,Fennec,Snuke);
 
  return 0;
}


Measured memory_bytes: 44416