#include<cstdio>
#include<vector>
#include<algorithm>
#define MN 2100001
using namespace std;
 
int n,m,a[MN],x,y,fa[MN],s[MN],d[MN]; 
vector<int> v[MN];
void dfs(int x,int f){
fa[x]=f;s[x]=1;
    for (int i=0;i<v[x].size();i++)
    if (v[x][i]!=f){
        d[v[x][i]]=d[x]+1;
        dfs(v[x][i],x);
        s[x]+=s[v[x][i]];
    }
}
int main(){
    scanf("%d",&n);
    for (int i=1;i<n;i++){
        scanf("%d%d",&x,&y);
        v[x].push_back(y);v[y].push_back(x);
    }
    dfs(1,0);
    x=n;y=d[x]-(d[x]-1>>1);
    while (d[x]!=y) x=fa[x];
    if (n-s[x]>s[x]) puts("Fennec");else puts("Snuke");
}