#include #include using namespace std; using namespace atcoder; #define REP(i,a,n) for(int i=(a); i<(int)(n); i++) #define rep(i,n) REP(i,0,n) #define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it) #define ALLOF(c) (c).begin(), (c).end() typedef long long ll; typedef unsigned long long ull; //using mint = modint1000000007; //using mint = modint998244353; ll calc(const vector& a, const vector& b){ int p = 0; while(a[p] != 1) p++; int q = 0; while(b[q] != 1) q++; ll ret = 0; while(true){ ret += abs(p-q); p++; q++; while(p& a){ int N = a.size(); vector b1(N), b2(N); rep(i,N){ if(i%2==0){ b1[i] = 0; b2[i] = 1; }else{ b1[i] = 1; b2[i] = 0; } } vector dpl(N,0), dpr(N,0); { int p = 0; while(a[p] != 1) p++; int q = 0; while(b1[q] != 1) q++; ll ret = 0; while(true){ ret += abs(p-q); dpl[q] = ret; p++; q++; while(p=0 && a[p] != 1) p--; if(p < 0) break; while(q>=0 && b2[q] != 1) q--; } } ll ret = min(dpl[N-1], dpr[0]); for(int i=1; i> N; vector v(N); rep(i,N) cin >> v[i]; ll X = N/2; vector w(N); rep(i,N){ if(v[i] <= X) w[i] = 1; else w[i] = 0; } ll Y = 1e18; if(N%2!=0){ vector z(N); rep(i,N){ if(i%2==0) z[i] = 0; else z[i] = 1; } Y = min(Y, calc(w, z)); }else{ Y = min(Y, calc2(w)); } cout << X << " " << Y << endl; return 0; }