// clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
using namespace std;
using pii = pair<int, int>;
using vi = vector<int>;
using vd = vector<double>;
using vc = vector<char>;
using vb = vector<bool>;
using vs = vector<string>;
using vpii = vector<pii>;
using vvi = vector<vi>;
using vvb = vector<vb>;
using vvpii = vector<vpii>;
template<typename A> using fn = function<A>;
constexpr int INF = sizeof(int) == sizeof(long long) ? 1000000000000000000LL : 1000000000;
constexpr int MOD = 1000000007;
constexpr double PI = acos(-1);
template<typename A, typename B> bool cmin(A &a, const B &b) { return a > b ? (a = b, true) : false; }
template<typename A, typename B> bool cmax(A &a, const B &b) { return a < b ? (a = b, true) : false; }
constexpr bool odd(const int &n) { return n & 1; }
constexpr bool even(const int &n) { return !odd(n); }
// clang-format on
 
using Weight = int;
struct Edge {
  int src, dst;
  Weight weight;
  Edge(int s = 0, int d = 0, Weight w = 0)
    : src(s), dst(d), weight(w) {
  }
};
 
using Edges  = vector<Edge>;
using Graph  = vector<Edges>;
using Array  = vector<Weight>;
using Matrix = vector<Array>;
 
void addArc(Graph &g, const int &a, const int &b, const Weight &w = 1) {
  g[a].emplace_back(a, b, w);
}
 
void addEdge(Graph &g, const int &a, const int &b, const Weight &w = 1) {
  addArc(g, a, b, w);
  addArc(g, b, a, w);
}
 
// deps: graph-basic
vector<int> dijkstra(const Graph &g, const int &s) {
  using state = tuple<Weight, int>;
  priority_queue<state, vector<state>, greater<state>> q;
  vector<Weight> dist(g.size(), INF);
  vector<int> ft(g.size());
  dist[s] = 0;
  q.emplace(0, s);
  while (q.size()) {
    Weight d;
    int v;
    tie(d, v) = q.top();
    q.pop();
    if (dist[v] < d) continue;
    for (auto &e : g[v]) {
      if (cmin(dist[e.dst], dist[v] + e.weight)) {
        ft[e.dst] = v;
        q.emplace(dist[e.dst], e.dst);
      }
    }
  }
  return ft;
}
 
main {
  int n;
  cin >> n;
  Graph g(n);
  rep(_, n - 1) {
    int a, b;
    cin >> a >> b;
    addEdge(g, --a, --b);
  }
  set<int> pset;
  {
    vi ft = dijkstra(g, 0);
    int i = n - 1;
    for (;;) {
      i = ft[i];
      if (i == 0) break;
      pset.insert(i);
    }
  }
  vi state(n);
  priority_queue<pair<int, int>> bq, wq;
  bq.emplace(0, 0);
  wq.emplace(0, n - 1);
  for (;;) {
    for (int i = 0; i < 1;) {
      if (bq.size() == 0) {
        cout << "Snuke" << endl;
        return 0;
      }
      int p = bq.top().se;
      bq.pop();
      if (state[p]) continue;
      state[p] = 1;
      for (auto &e : g[p]) bq.emplace(pset.count(e.dst), e.dst);
      i++;
    }
    for (int i = 0; i < 1;) {
      if (wq.size() == 0) {
        cout << "Fennec" << endl;
        return 0;
      }
      int p = wq.top().se;
      wq.pop();
      if (state[p]) continue;
      state[p] = 1;
      for (auto &e : g[p]) wq.emplace(pset.count(e.dst), e.dst);
      i++;
    }
  }
}

Measured memory_bytes: 14320