// Slower C++ solution:
/*****************

 *   I<3   C++   *

 *  IWANT ANYAC  *

 * ILOVEPROGRAM! *

 *IT'SINTERESTING*

 * ILOVEPROGRAM! *

 *  INCONTESTS   *

 *   GETSCORE    *

 *    ACCODE     *

 *     LETS      *

 *      GO       *

 *****************/

#include <algorithm>

#include <bitset>

#include <cassert>

#include <cctype>

#include <cmath>

#include <complex>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <ctime>

#include <deque>

#include <fstream>

#include <functional>

#include <iomanip>

#include <iostream>

#include <list>

#include <map>

#include <numeric>

#include <queue>

#include <set>

#include <sstream>

#include <stack>

#include <string>

#include <utility>

#include <vector>

#define LL long long

#define pb push_back

#define pob pop_back

#define mp make_pair

#define FILL(a,v) memset((void*)a,v,sizeof(a))

#define FILL0(a) FILL(a,0)

#define FILL1(a) FILL(a,-1)

#define ALL(a) (a).begin(),(a).end()

#define Inf 1e9

#define Mod 1000000007

#define foreach(it,x) for(typeof(x.begin()) it=x.begin();it!=x.end();it++)

#define FOR(i,x) for(int i=0;i<x;i++)

#define RFOR(i,x) for(int i=x-1;i>=0;i--)

#define FFOR(i,a,b) for(int i=a;i<b;i++)

#define FRFOR(i,a,b) for(int i=a-1;i>=b;i--)

#define SZ(a) ((int)(a).size())

#define FI first

#define SE second

#define OVER(a) return puts(a),0

#define fastio ios::sync_with_stdio(0)

#define filei(f) freopen(f,"r",stdin)

#define fileo(f) freopen(f,"w",stdout)

#define MASK(a) (1<<(a))

#define MASKX(x,a) ((x)<<(a))

#define BIT(a,b) ((a>>b)&1)

using namespace std;

typedef pair<int,int> pii;

typedef unsigned long long UINT;

typedef unsigned int Uint;

typedef long long INT;

typedef pair<INT,INT> PII;

typedef stringstream sst;

typedef istringstream iss;

typedef vector<int> vint;

typedef vector<INT> VINT;

typedef vector<pii> vpii;

typedef vector<PII> VPII;

typedef priority_queue<int> pqi;

typedef priority_queue<INT> PQI;

typedef priority_queue<pii> pqp;

typedef priority_queue<PII> PQP;

typedef priority_queue<int,vint,greater<int> > xqi;

typedef priority_queue<INT,VINT,greater<INT> > XQI;

typedef priority_queue<pii,vpii,greater<pii> > xqp;

typedef priority_queue<PII,VPII,greater<PII> > XQP;



int n,fromst;

vector<int> jian,nei[100007];

int dis[100007],cnt[100007];



int dfs(int la,int a)

{

	int cn=1;

	jian.push_back(a);

	if(a==n-1)fromst=jian[(SZ(jian)+1)/2];

	for(int i=0;i<SZ(nei[a]);i++)

		if(nei[a][i]!=la)

			cn+=dfs(a,nei[a][i]),dis[nei[a][i]]=dis[a]+1;

	jian.pop_back();

	cnt[a]=cn;

	return cn;

}



int a,b;



int main()

{

	scanf("%d",&n);

	for(int i=0;i<n-1;i++)

	{

		scanf("%d%d",&a,&b);

		nei[a-1].push_back(b-1);

		nei[b-1].push_back(a-1);

	}

	dfs(-1,0);

	string mark;

	if(cnt[fromst]>=(n+1)/2)mark="Snuke";

	else mark="Fennec";

	cout<<mark<<endl;

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 3.5094180242831703x):
#include<bits/stdc++.h>



using namespace std;



vector<vector<int> > g;



void go(int u, int w, vector<int> &d, int p = -1) {

    d[u] = w;

    for(auto v : g[u]) {

        if(v != p) {

            go(v, w+1, d, u);

        }

    }

}



int main() {

    #ifdef LOCAL

        freopen("input.txt", "r", stdin);

        freopen("output.txt", "w", stdout);

    #else

        #define endl '\n'

    #endif



    int n; cin >> n;

//    cout << "asdasd" << endl;

    g.assign(n+1, vector<int>());

    for(int i = 1; i < n; i++) {

        int a, b; cin >> a >> b;

        g[a].push_back(b);

        g[b].push_back(a);

    }

    vector<int> d1(n+1), d2(n+1);

    go(1, 0, d1);

    go(n, 0, d2);



    int wina = 0, winb = 0;

    for(int i = 1; i <= n; i++) {

        if(d1[i] <= d2[i])

            wina++;

        else

            winb++;

    }



//    cout << wina << " " << winb << endl;



    if(wina > winb) cout << "Fennec" << endl;

    else cout << "Snuke" << endl;



}