#include<bits/stdc++.h>
#define maxn 200050
#define inf 0x3f3f3f3f
#define LL long long
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second
#define mm(a,b) memset(a,b,sizeof(a))
#define mp(a,b) make_pair(a,b)
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
const double eps = 1e-6;
const LL mod=1e9+7;
const LL INF=(LL)1e18;
using namespace std;
LL gcd(LL a,LL b){return b==0?a:gcd(b,a%b);}
LL qpow(LL x,LL y){LL re=1,base=x%mod;while(y){if(y&1)re=(re*base)%mod;base=(base*base)%mod;y>>=1;}return re;}
LL a[maxn];
LL fisum[maxn],basum[maxn]; 
int main(){
//	freopen("input.txt","r",stdin);
//	freopen("ouput.txt","w",sdout);
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	int n;
	cin>>n;
	mm(fisum,0),mm(basum,0);
	for(int i=1;i<=n;i++){
		cin>>a[i];
		fisum[i]=fisum[i-1]+a[i];
	}
	basum[n]=a[n];
	for(int i=n-1;i>=1;i--) basum[i]=basum[i+1]+a[i];
	LL ans=INF;
	for(int i=1;i<n;i++) ans=min(ans,abs(fisum[i]-basum[i+1]));
	cout<<ans<<endl;
	return 0;
}

#include<bits/stdc++.h>
#define maxn 100050
#define inf 0x3f3f3f3f
#define LL long long
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second
#define mm(a,b) memset(a,b,sizeof(a))
#define mp(a,b) make_pair(a,b)
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
const double eps = 1e-6;
const LL mod=1e9+7;
const LL INF=(LL)1e18;
using namespace std;
LL gcd(LL a,LL b){return b==0?a:gcd(b,a%b);}
LL qpow(LL x,LL y){LL re=1,base=x%mod;while(y){if(y&1)re=(re*base)%mod;base=(base*base)%mod;y>>=1;}return re;}
int vis[maxn],dis1[maxn],dis2[maxn];
struct node{
	int to,w;
	node(int to,int w):to(to),w(w){}
};
vector<node>e[maxn];
void dfs(int id,int dis[]){
	for(int i=0;i<e[id].size();i++){
		int next=e[id][i].to,ww=e[id][i].w;
		if(vis[next]) continue;
		dis[next]=dis[id]+ww;
		vis[next]=1;
		dfs(next,dis);
	}
} 
int main(){
//	freopen("input.txt","r",stdin);
//	freopen("ouput.txt","w",sdout);
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	mm(vis,0),mm(dis1,0),mm(dis2,0);
	int n;
	cin>>n;
	for(int i=1;i<n;i++){
		int x,y;
		cin>>x>>y;
		e[x].pb(node(y,1));
		e[y].pb(node(x,1));
	}
	vis[1]=1;
	dfs(1,dis1);
	mm(vis,0),vis[n]=1;
	dfs(n,dis2);
	int ans=0;
	for(int i=2;i<n;i++){
		if(dis1[i]<=dis2[i]) ans++;
		else ans--;
	}
	if(ans>0) cout<<"Fennec"<<endl;
	else cout<<"Snuke"<<endl;
	return 0;
}

#include <bits/stdc++.h>
using namespace std;
int F[1 << 15][15], Mx[15][1 << 15], Sm[1 << 15], B[15][15], Tmp[15], n, m;
vector <int> hsh[1 << 15];
void cmax(int& x, int y) {if(x < y) x = y;}
int main()
{
	scanf("%d%d", &n, &m), memset(B, -1, sizeof B);
	for(int i = 1; i <= m; i++) {
		int a, b, c;
		scanf("%d%d%d", &a, &b, &c), a--, b--;
		B[a][b] = B[b][a] = c;
	}
	memset(Mx, -1, sizeof Mx), memset(F, 200, sizeof F);
	for(int i = 0; i < (1 << n); i++)
		for(int j = 0; j < n; j++) if(i >> j & 1) hsh[i].push_back(j);
	for(int i = 0; i < (1 << n); i++)
		for(int j = 0; j < n; j++) if(i >> j & 1)
			for(int k = j + 1; k < n; k++) if((i >> k & 1) && B[j][k] != -1) Sm[i] += B[j][k];
	for(int i = 0; i < n; i++)
		for(int j = 1; j < (1 << n); j++)
			for(int k = 0; k < n; k++) if(j >> k & 1) {
				Mx[i][j] = max(B[i][k], Mx[i][j - (1 << k)]);
				break;
			}
	for(int i = 1; i < (1 << n); i += 2) F[i][0] = Sm[i];
	for(int i = 1; i < (1 << n); i += 2) {
		memset(Tmp, 200, sizeof Tmp);
		for(int j = 0; j < n; j++) if(F[i][j] >= 0)
			for(int k = 0; k < n; k++) if(B[j][k] != -1)
				cmax(Tmp[k], F[i][j] + B[j][k]);
		for(int s = (1 << n) - i - 1, j = s; j; j = (j - 1) & s)
			for(int k = 0; k < hsh[j].size(); k++)
				cmax(F[i + j][hsh[j][k]], Tmp[hsh[j][k]] + Sm[j]);
	}
	printf("%d\n", Sm[(1 << n) - 1] - F[(1 << n) - 1][n - 1]);
	return 0;
}