Language: C++

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<double> vdbl;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<int> > vvint;
typedef vector<pair<int, int> > vpii;
typedef vector<pair<ll, ll> > vpll;
typedef priority_queue<int, vector<int>, greater<int> > spqint; //小さい順に取り出し
typedef priority_queue<ll, vector<ll>, greater<ll> > spqll;     //小さい順に取り出し
typedef priority_queue<int, vector<int>, less<int> > bpqint;    //大きい順に取り出し
typedef priority_queue<ll, vector<ll>, less<ll> > bpqll;        //大きい順に取り出し

#define REP(i, n) for (int(i) = 0; (i) < (int)(n); i++)
#define FOR(i, a, b) for (int(i) = a; (i) < (int)b; i++)
#define IREP(i, v) for (auto i = v.begin(); i != v.end(); i++)
#define MOD 1000000007
#define NIL -1
#define FI first
#define SE second
#define MP make_pair
#define PB push_back
#define PF push_front
#define TS to_string
#define BS binary_search
#define LB lower_bound
#define UB upper_bound
#define NP next_permutation
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) (ll) x.size()
#define SP(x) setprecision((ll)x)

const int INF = 1e9;
const ll LINF = 1e18;
const double EPS = 1e-9;
const double PI = M_PI;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } //最大公約数
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }     //最小公倍数

void yes()
{
    cout << "Fennec" << endl;
}
void no()
{
    cout << "Snuke" << endl;
}
//-----------------------------------------
int V, E ;
vector<int> seen ;
queue<int> que ;
//-----------------------------------------
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n ;
    cin >> n ;
    V = n ;

    vector<int> zero(V,0) ;
    seen = zero ;
    vvint g(n) ;

    REP(i,n-1){
        int a, b ;
        cin >> a >> b ;
        g[a-1].PB(b-1) ;
        g[b-1].PB(a-1) ;
    }


    vector<int> set1 ;
    vector<int> set2 ;

    que.push(0) ;
    seen[0] = 1 ;

    while(!que.empty()){
        int k = que.front() ;
        set1.PB(k) ;
        que.pop() ;
        for(int i=0;i<g[k].size();i++){
            if(seen[g[k][i]]==0 && g[k][i]!=n-1){
                que.push(g[k][i]) ;
                seen[g[k][i]] = 1 ;
            }
        }
    }

    seen = zero ;



    que.push(n-1) ;
    seen[n-1] = 1 ;

    while(!que.empty()){
        int k = que.front() ;
        set2.PB(k) ;
        que.pop() ;
        for(int i=0;i<g[k].size();i++){
            if(seen[g[k][i]]==0 && g[k][i]!=0){
                que.push(g[k][i]) ;
                seen[g[k][i]] = 1 ;
            }
        }
    }    

    int fc = 0 ;
    int sc = 0 ;

    int cnt = 0 ;

    REP(i,SZ(set1)){
        if(BS(ALL(set2),set1[i])){
                cnt++ ;
        }
    }

    fc = SZ(set1) -cnt ;
    sc = SZ(set2) -cnt ;
    fc += cnt/2 + cnt%2 ;
    sc += cnt/2 ;

    if(fc=>sc){
        yes() ;
    }
    else{
        no() ;
    }

    return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:133:11: error: expected primary-expression before '>' token
  133 |     if(fc=>sc){
      |           ^