#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    int N; cin >> N;
    using ld = long double;
    vector<ld> x(N);
    rep(i,N) cin >> x[i];
    int M; cin >> M; M--;

    ld mean = accumulate(x.begin(), x.end(), 0) / ld(N);
    ld se = 0;
    rep(i,N) se += (x[i] - mean) * (x[i] - mean);
    se /= ld(N);
    se = sqrtl(se);
    if(se <= 1e-8) { cout << 50 << endl; return 0; }
    ld ans = (x[M] - mean) * 10.0 / se + 50.0;
    cout << floorl(ans - 1e-6) << endl;
}