Language: C++

#include <iostream>
#include <ccomplex>
#include <vector>
#include <cassert>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <numeric>
#include <list>
#include <assert.h>
#include <math.h>
#include <valarray>
#include <stdio.h>
#include <algorithm>
#include <set>
#include <complex>
#include <list>
#include <time.h>
#include <stack>
#include <locale>
#include <clocale>
#include <ctype.h>
#include <wchar.h>

using namespace std;
typedef long long int LL;
typedef pair<long long int, long long int> pii;
typedef pair<double, double> pdd;

#define SORT(c) sort((c).begin(),(c).end())
#define BACKSORT(c) sort((c).begin(),(c).end(),std::greater<LL>())
#define FOR(i,a,b) for(LL i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)


int xcomp(vector<LL>& a, vector<LL>& b) {
	return a[0] < b[0];
}

#define XSORT(c) sort((c).begin(),(c).end(),xcomp)

#define ALL(x) (x).begin(),(x).end()
LL mod = 1000000007;


vector<vector<LL>> v(100001, vector<LL>(0));

LL N;

LL sum = 2;

void dfs(vector<bool> &b, int index,int l) {
	REP(i, v[index].size()) {
		if (b[v[index][i]] == false) {
			if (v[index][i] != N) {
				b[v[index][i]] = true;
				sum++;
				dfs(b, v[index][i],l+1);
			}
			else {
				sum -= l - (l / 2);
			}
		}
	}
}

int main() {
	cin >> N;

	REP(i, N-1) {
		LL a, b;
		cin >> a >> b;
		v[a].push_back(b);
		v[b].push_back(a);
	}

	vector<bool> bo(N + 1, false);
	dfs(bo, 1,0);

	if (N - sum < sum) {
		cout << "Fennec" << endl;
	}
	else {
		cout << "Snuke" << endl;
	}
}
#include <iostream>
#include <ccomplex>
#include <vector>
#include <cassert>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <numeric>
#include <list>
#include <assert.h>
#include <math.h>
#include <valarray>
#include <stdio.h>
#include <algorithm>
#include <set>
#include <complex>
#include <list>
#include <time.h>
#include <stack>
#include <locale>
#include <clocale>
#include <ctype.h>
#include <wchar.h>

using namespace std;
typedef long long int LL;
typedef pair<long long int, long long int> pii;
typedef pair<double, double> pdd;

#define SORT(c) sort((c).begin(),(c).end())
#define BACKSORT(c) sort((c).begin(),(c).end(),std::greater<LL>())
#define FOR(i,a,b) for(LL i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)


int xcomp(vector<LL>& a, vector<LL>& b) {
	return a[0] < b[0];
}

#define XSORT(c) sort((c).begin(),(c).end(),xcomp)

#define ALL(x) (x).begin(),(x).end()
LL mod = 1000000007;


vector<vector<LL>> v(100001, vector<LL>(0));

LL N;

LL sum = 2;

void dfs(vector<bool> &b, int index,int l) {
	REP(i, v[index].size()) {
		if (b[v[index][i]] == false) {
			if (v[index][i] != N) {
				b[v[index][i]] = true;
				sum++;
				dfs(b, v[index][i],l+1);
			}
			else {
				sum -= l - (l / 2);
			}
		}
	}
}

int main() {
	cin >> N;

	REP(i, N-1) {
		LL a, b;
		cin >> a >> b;
		v[a].push_back(b);
		v[b].push_back(a);
	}

	vector<bool> bo(N + 1, false);
	dfs(bo, 1,0);

	if (N - sum < sum) {
		cout << "Fennec" << endl;
	}
	else {
		cout << "Snuke" << endl;
	}
}


Compiler output:
a.cc:134:5: error: redefinition of 'int xcomp(std::vector<long long int>&, std::vector<long long int>&)'
  134 | int xcomp(vector<LL>& a, vector<LL>& b) {
      |     ^~~~~
a.cc:42:5: note: 'int xcomp(std::vector<long long int>&, std::vector<long long int>&)' previously defined here
   42 | int xcomp(vector<LL>& a, vector<LL>& b) {
      |     ^~~~~
a.cc:141:4: error: redefinition of 'LL mod'
  141 | LL mod = 1000000007;
      |    ^~~
a.cc:49:4: note: 'LL mod' previously defined here
   49 | LL mod = 1000000007;
      |    ^~~
a.cc:144:20: error: redefinition of 'std::vector<std::vector<long long int> > v'
  144 | vector<vector<LL>> v(100001, vector<LL>(0));
      |                    ^
a.cc:52:20: note: 'std::vector<std::vector<long long int> > v' previously declared here
   52 | vector<vector<LL>> v(100001, vector<LL>(0));
      |                    ^
a.cc:146:4: error: redefinition of 'LL N'
  146 | LL N;
      |    ^
a.cc:54:4: note: 'LL N' previously declared here
   54 | LL N;
      |    ^
a.cc:148:4: error: redefinition of 'LL sum'
  148 | LL sum = 2;
      |    ^~~
a.cc:56:4: note: 'LL sum' previously defined here
   56 | LL sum = 2;
      |    ^~~
a.cc:150:6: error: redefinition of 'void dfs(std::vector<bool>&, int, int)'
  150 | void dfs(vector<bool> &b, int index,int l) {
      |      ^~~
a.cc:58:6: note: 'void dfs(std::vector<bool>&, int, int)' previously defined here
   58 | void dfs(vector<bool> &b, int index,int l) {
      |      ^~~
a.cc:165:5: error: redefinition of 'int main()'
  165 | int main() {
      |     ^~~~
a.cc:73:5: note: 'int main()' previously defined here
   73 | int main() {
      |     ^~~~