#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <utility>
#include <string>
#include <cstring>
#include <queue>
#include <deque>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <numeric>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;

vector<int> edge[100100];
vector<int> path;
int group[100100];
int root[100100];
int N;
bool dfs(int v, int par = -1) {

  if (v == N-1) {
    path.pb(v);
    return true;
  }
             
  for (auto nv : edge[v]) {
    if (nv == par) {
      continue;
    }
    if (dfs(nv, v)) {
      path.pb(v);
      return true;
    }
  }
  return false;
}

void cut(int a, int b){
  edge[a].erase(find(ALL(edge[a]), b));
  edge[b].erase(find(ALL(edge[b]), a));
}

int dfs2(int v, int r, int par = -1) {
  int cnt = 1;
  root[v] = r;
  for (auto nv : edge[v]) {
    if (nv == par) {
      continue;
    }
    cnt += dfs2(nv, r, v);
  }
  return cnt;
}
void makeGroup(int v){
  if (root[v] != -1) {
    return;
  }
  group[v] = dfs2(v, v);
}

int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cin >> N;
  rep(i,N-1){
    int a,b;
    cin >> a >> b;
    a--;b--;
    edge[a].pb(b); edge[b].pb(a);
  }
  dfs(0);
  reverse(ALL(path));
  rep(i,sz(path)-1){
    int a = path[i], b = path[i+1];
    cut(a,b);
  }
  mem(group, 0);
  mem(root, -1);
  rep(i,N){
    makeGroup(i);
    group[i] = group[root[i]];
  }
  deque<int> path2(ALL(path));
  //DEBUG1(path);
  int G[2] = {};
  G[0] = group[path2.front()] -1;//0
  G[1] = group[path2.back()] -1;//N-1
  path2.pop_front(); path2.pop_back();
  bool b = false;
  while(!path2.empty()){
    int v;
    if (!b) {
      v = path2.front();
      path2.pop_front();
    } else {
      v = path2.back();
      path2.pop_back();
    }
    G[b] += group[v];
    b = !b;
    //DEBUG4(b, v, group[v], G[b]);
  }
  //DEBUG2(G[0], G[1]);
  if (G[0] <= G[1]) {
    cout << "Snuke" << endl;
  } else {
    cout << "Fennec" << endl;
  }
  
  
  return 0;
}


Measured memory_bytes: 12024