#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <map>
#include <iostream>
#include <utility>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <unordered_set>
#include <unordered_map>
#include <limits.h>
#include <cstring>
#include <tuple>
#include <cassert>
#include <numeric>
using namespace std;
// type alias
typedef long long LL;
typedef vector < int > VI;
typedef unordered_map < int, int > MAPII;
typedef unordered_set < int > SETI;
typedef pair< int , int > II;
typedef tuple< int, int, int > III;
// repetition
#define FORE(i,a,b) for(int i=(a);i<=(b);++i)
#define REPE(i,n)  for(int i=0;i<=(n);++i)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  for(int i=0;i<(n);++i)
#define FORR(x,arr) for(auto& x:arr)
#define SZ(a) int((a).size())
// DP
#define MINUS(dp) memset(dp, -1, sizeof(dp))
#define ZERO(dp) memset(dp, 0, sizeof(dp))
// minmax
#define SMAX(a,b) a = max(a,b)
#define SMIN(a,b) a = min(a,b)
// debug cerr
#define TRACE true
#define dump(x) if(TRACE) { cerr << #x << " = " << (x) << endl; }
#define dump2(x,y) if(TRACE) { cerr << #x << " = " << (x) << ", " << #y << " = " << (y) << endl; }
#define dump3(x,y,z) if(TRACE) { cerr << #x << " = " << (x) << ", " << #y << " = " << (y) << ", " << #z << " = " << (z) << endl; }
#define dump4(x,y,z,a) if(TRACE) { cerr << #x << " = " << (x) << ", " << #y << " = " << (y) << ", " << #z << " = " << (z) << ", " << #a << " = " << (a) << endl; }
#define dumpAR(ar) if(TRACE) { FORR(x,(ar)) { cerr << x << ','; } cerr << endl; }

/*

 7/12/2018

 16:08-16:58 AC
 18:50-19:02 add solution with distance comparison shown in editorial

 Editorials:
  - https://atcoder.jp/img/arc078/editorial.pdf
  - https://youtu.be/sWnEkDYPxxs?t=1686
  - http://hamayanhamayan.hatenablog.jp/entry/2017/07/15/232647
  - https://kimiyuki.net/writeup/algo/atcoder/arc-078-d/
  - https://ei1333.hateblo.jp/entry/2017/07/16/011806
  - http://omochan.hatenablog.com/entry/2017/07/15/235032
  - http://htkb-procon.hateblo.jp/entry/2017/07/16/164932
  - http://bttb.s1.valueserver.jp/wordpress/blog/2017/07/16/atcoder-beginner-contest-067-d-fennec-vs-snuke/

 @kmjp's beautiful dfs solution:
  - https://beta.atcoder.jp/contests/arc078/submissions/1423142

 Key:
  - |{dist(1,x)>=dist(N,x) : x∈V}| vs |{dist(1,x)>dist(N,x) : x∈V}|
  - dfs can compute distance from node `1` and `N`

 Summary:
  - Tons of implementation bugs 😡
  - Comparing distance from `1` and `N` is beautiful.

 5/22/2020

 8:50-9:30 solve again

 */

// $ cp-batch FennecVSSnuke | diff FennecVSSnuke.out -
// $ g++ -std=c++14 -Wall -O2 -D_GLIBCXX_DEBUG -fsanitize=address FennecVSSnuke.cpp && ./a.out

const string P1="Fennec",P2="Snuke";
const int MAX_N=1e5+1;
int N;
VI E[MAX_N];
int C[MAX_N];

VI G[MAX_N];
int D[2][MAX_N];
void dfs2(int u, int pre, int c, int d) {
  D[c][u]=d;
  FORR(v,G[u]) if(v!=pre) dfs2(v,u,c,d+1);
}
void solve() {
  dfs2(0,-1,0,0),dfs2(N-1,-1,1,0);
  VI cnt(2,0);
  REP(u,N) cnt[(D[0][u]<=D[1][u])?0:1]++;
  cout<<(cnt[0]>cnt[1]?"Fennec":"Snuke")<<endl;
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout<<setprecision(12)<<fixed;

  cin>>N;
  REP(i,N-1) {
    int u,v; cin>>u>>v;
    --u,--v;
    G[u].push_back(v),G[v].push_back(u);
  }
  solve();

  return 0;
}

VI P;
void dfs(int u, int pre, VI &cur) {
  cur.push_back(u);
  if(u==N) {
    P=cur;
    return;
  }
  FORR(v,E[u]) if(v!=pre) {
    dfs(v,u,cur);
  }
  cur.pop_back();
}
void dfs2(int u, int c) {
  FORR(v,E[u]) if(C[v]==0) {
    dump2(v,c);
    C[v]=c;
    dfs2(v,c);
  }
}

void solve_org() {
  VI p={};
  dfs(1,-1,p);
  dumpAR(P);
  assert(SZ(P));
  ZERO(C);
  int l=0,r=SZ(P)-1;
  VI Q1,Q2;
  while(l<r) {
    Q1.push_back(P[l]),Q2.push_back(P[r]);
    C[P[l++]]=1,C[P[r--]]=2;
  }
  dump2(C[P.front()],C[P.back()]);
  dumpAR(Q1);
  dumpAR(Q2);
  FORR(u,Q1) dfs2(u,1);
  FORR(u,Q2) dfs2(u,2);

  int cnt[3]={};
  REPE(i,N) cnt[C[i]]++;
  dump2(cnt[1],cnt[2]);
  string res=cnt[1]>cnt[2]?P1:P2;
  cout<<res<<endl;
}

void dfs(int u, int pre, int c, int d) {
  D[c][u]=d;
  FORR(v,E[u]) if(v!=pre) dfs(v,u,c,d+1);
}
void solve_kmjp() {
  dfs(1,-1,0,0),dfs(N,-1,1,0);
  int cnt1=0,cnt2=0;
  FORE(u,1,N) (D[0][u]<=D[1][u]?cnt1:cnt2)++;
//  dump2(cnt1,cnt2);
  string res=cnt1>cnt2?P1:P2;
  cout<<res<<endl;
}

int main_org() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  REPE(i,N) E[i].clear();

  cin>>N;
  REP(i,N-1) {
    int u,v;
    cin>>u>>v;
    E[u].push_back(v),E[v].push_back(u);
  }
  solve();
  return 0;
}


Measured memory_bytes: 15488