// Original C++ solution (slower):
//include

//------------------------------------------

#include <bits/stdc++.h>

using namespace std;



//typedef

//------------------------------------------

typedef long long LL;

typedef vector<LL> VL;

typedef vector<VL> VVL;

typedef vector<string> VS;

typedef pair<LL, LL> PLL;



//container util

//------------------------------------------

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

#define RALL(a) (a).rbegin(), (a).rend()

#define PB push_back

#define MP make_pair

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

#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)

#define EXIST(s,e) ((s).find(e)!=(s).end())

#define SORT(c) sort((c).begin(),(c).end())



//constant

//--------------------------------------------

const double EPS = 1e-10;

const double PI  = acos(-1.0);

const int MOD = 1000000007;



//debug

#define dump(x)  cerr << #x << " = " << (x) << endl;

#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;



//main code



int n;

const int NMAX = 100010;

VVL tree(NMAX);

VL depth_s(NMAX), depth_g(NMAX);



void dfs(LL v, LL p, LL d,bool s){

    if (s) {

        depth_s[v] = d;

    }

    else {

        depth_g[v] = d;

    }



    for (auto&& var : tree[v]) {

        if (var == p) {

            continue;

        }

        dfs(var,v,d+1,s);

    }

}



int main(int argc, char const* argv[])

{

    cin >> n;

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

        int a,b;

        cin  >> a >> b;

        tree[a].push_back(b);

        tree[b].push_back(a);

    }

    dfs(1,-1,0,true);

    dfs(n,-1,0,false);

    LL w = 0,b = 0;

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

        if (depth_s[i] > depth_g[i]) {

            w++;

        }

        else {

            b++;

        }

    }



    if (w >= b) {

        cout << "Snuke" << endl;

    }

    else {

        cout << "Fennec" << endl;

    }

    return 0;

}




// Optimized solution to the same problem (faster):
//include

//------------------------------------------

#include <bits/stdc++.h>

using namespace std;



//typedef

//------------------------------------------

using LL = int64_t;

using VL = vector<LL>;

using VVL = vector<VL>;

using VS = vector<string>;

using PLL = pair<LL, LL>;



//container util

//------------------------------------------

#define whole(f,x,...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x)

#define rwhole(f,x,...) ([&](decltype((x)) whole) { return (f)(rbegin(whole), rend(whole), ## __VA_ARGS__); })(x)

#define EACH(i,c) for(decltype((c).begin()) i=(c).begin(); i!=(c).end(); ++i)

#define EXIST(s,e) ((s).find(e)!=(s).end())

#define ALL(x) ::std::begin(x), ::std::end(x)

#define RALL(x) ::std::rbegin(x), ::std::rend(x)

#define SORT(c) whole(sort, c)

#define RSORT(c) rwhole(sort, c)



//constant

//--------------------------------------------

constexpr double EPS = 1e-10;

constexpr double PI  = 3.14159265358979323846;

constexpr int MOD = 1000000007;



// grid

//--------------------------------------------

VL dx = {0, 1, 0, -1};

VL dy = {1, 0, -1, 0};

VL dx2 = {-1, 0, 1, -1, 1, -1, 0, 1};

VL dy2 = {-1, -1, -1, 0, 0, 1, 1, 1};



//debug

//--------------------------------------------

#define dump(x)  cerr << #x << " = " << (x) << endl;

#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;



//IO accelerate

//--------------------------------------------

struct InitIO {

    InitIO() {

        cin.tie(nullptr);

        ios_base::sync_with_stdio(false);

        cout << fixed << setprecision(30);

    }

} init_io;



//template

//--------------------------------------------

// declaretion

template<typename T> istream& operator >>(istream& is, vector<T>& vec);

template<typename T1, typename T2> ostream& operator <<(ostream& os, const pair<T1, T2>& p);

template<typename T> ostream& operator <<(ostream& os, const vector<T>& vec);

template<typename T> ostream& operator <<(ostream& os, const vector<vector<T>>& vv);

template<typename T> vector<T> make_v(size_t a);

template<typename T,typename... Ts> auto make_v(size_t a,Ts... ts);

template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type fill_v(T &t,const V &v);

template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type fill_v(T &t,const V &v);



// implementation

template<typename T>

istream& operator >>(istream& is, vector<T>& vec) {

	for(T& x: vec) is >> x;

	return is;

}

template<typename T1, typename T2>

ostream& operator <<(ostream& os, const pair<T1, T2>& p) {

	os << p.first << "," << p.second;

	return os;

}

template<typename T>

ostream& operator <<(ostream& os, const vector<T>& vec) {

	for(int i=0; i<vec.size(); i++){

		os << vec[i] << ( i+1 == vec.size() ? "" : "\t" );

	}

	return os;

}

template<typename T>

ostream& operator <<(ostream& s, const vector<vector<T>>& vv) {

	for (int i = 0; i < vv.size(); ++i) {

		s << vv[i] << endl;

	}

	return s;

}



// 多重vector

// auto dp=make_v<int>(4,h,w) みたいに使える

template<typename T>

vector<T> make_v(size_t a){return vector<T>(a);}



template<typename T,typename... Ts>

auto make_v(size_t a,Ts... ts){

	return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));

}



// 多重vectorのためのfill

// fill_v(dp,0) みたいに使える

template<typename T,typename V>

typename enable_if<is_class<T>::value==0>::type

fill_v(T &t,const V &v){t=v;}



template<typename T,typename V>

typename enable_if<is_class<T>::value!=0>::type

fill_v(T &t,const V &v){

	for(auto &e:t) fill_v(e,v);

}



template<class T,class U> void chmax(T&a,U b){if(a<b)a=b;}

template<class T,class U> void chmin(T&a,U b){if(b<a)a=b;}

template<typename T> T gcd(T a, T b) { return b?gcd(b,a%b):a;}

template<typename T> T lcm(T a, T b) { return a/gcd(a,b)*b;}



//main code



int main(int argc, char *argv[])

{

	LL n;

	cin >> n;

	VVL g(n);

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

		int a,b;

		cin >> a >> b;

		a--;b--;

		g[a].push_back(b);

		g[b].push_back(a);

	}

	VVL d(2, VL(n,INT32_MAX));

	auto dfs = [&](auto&& dfs, int v, int w, int l) -> void {

		d[w][v] = l;

		for (auto i : g[v]) {

			if (d[w][i] > l+1) {

				dfs(dfs, i, w, l+1);

			}

		}

	};

	dfs(dfs, 0, 0, 0);

	dfs(dfs, n-1, 1, 0);

	int white = 0;

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

		if (d[0][i] > d[1][i]) {

			white++;

		}

	}

	if (white*2 >= n) {

		cout << "Snuke" << endl;

	} else {

		cout << "Fennec" << endl;

	}

	return 0;

}

// Fastest known solution for this problem: