#include<bits/stdc++.h> using namespace std; #include <atcoder/all> using namespace atcoder; using mint=modint998244353; //1000000007; using ll=long long; using pp=pair<ll,ll>; #define sr string #define vc vector #define fi first #define se second #define rep(i,n) for(ll i=0;i<(ll)n;i++) #define pb push_back #define all(v) v.begin(),v.end() #define pque priority_queue #define bpc(a) __builtin_popcount(a) int main(){ int n;cin>>n; vc<ll>v(n); rep(i,n)cin>>v[i]; sort(all(v)); ll sa=0,sb=0; rep(i,(n+1)/2)sa+=v[i]; for(int i=(n+1)/2;i<n;i++)sb+=v[i]; ll res=abs(sa)-abs(sb); sa=0,sb=0; rep(i,n){ if(i&1)sb+=v[i]; else sa+=v[i]; } res=min(res,abs(sa)-abs(sb)); sa=0,sb=0; rep(i,n/2)sb+=v[i]; for(int i=n/2;i<n;i++)sa+=v[i]; ll res2=abs(sa)-abs(sb); sa=0,sb=0; for(int i=n-1;i>=0;i--){ if((n-i)&1)sa+=v[i]; else sb+=v[i]; } res2=min(res2,abs(sa)-abs(sb)); ll ans=max(res,res2); cout<<ans; }