// https://atcoder.jp/contests/arc101/tasks/arc101_b
//
#![allow(unused_imports)]
use std::io::*;
use std::io::Write;
use std::fmt::*;
use std::str::*;
use std::cmp::*;
use std::collections::*;

// Input macros.
// Original by tanakh: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
#[allow(unused_macros)]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};

    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };

    ($iter:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };

    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };

    ($iter:expr, [ next / $t:tt ]) => {
        {
            let len = read_value!($iter, usize);
            (0..len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
        }
    };

    ($iter:expr, switch) => {
        {
            let ty = read_value!($iter, i32);
            if ty == 1 {
                vec![ty, read_value!($iter, i32), read_value!($iter, i32)]
            } else if ty == 2 {
                vec![ty, read_value!($iter, i32)]
            } else {
                vec![ty, read_value!($iter, i32)]
            }
        }
    };

    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };

    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };

    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused_macros)]
macro_rules! read_line {
    ($t:tt) => {
        {
            let mut s = String::new();
            std::io::stdin().read_line(&mut s).unwrap();
            s.trim_right().parse::<$t>().unwrap()
        }
    }
}

#[allow(unused_macros)]
macro_rules! dvec {
    ($t:expr ; $len:expr) => {
        vec![$t; $len]
    };

    ($t:expr ; $len:expr, $($rest:expr),*) => {
        vec![dvec!($t; $($rest),*); $len]
    };
}

#[allow(unused_macros)]
macro_rules! ifv {
    ($t:expr, $a:expr, $b: expr) => {
        if $t { $a } else { $b }
    }
}

#[allow(unused_macros)]
macro_rules! fill {
    ($t:expr, $v:expr) => {
        for i in 0..$t.len() {
            $t[i] = $v;
        }
    };
}

#[allow(unused_macros)]
macro_rules! join {
    ($t:expr, $glue:expr) => {
        $t.into_iter().map(|w| w.to_string()).collect::<Vec<_>>().join($glue)
    };
}

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        println!(concat!($(stringify!($a), " = {:?}, "),*), $($a),*);
    }
}

// ===

struct FenwickTree<T> {
    data: Vec<T>
}

impl<T: Copy + Default + std::ops::Add + std::ops::AddAssign + std::ops::Sub> FenwickTree<T> {
    fn new(n: usize, initial: T) -> Self {
        FenwickTree { data: vec![initial; n+1] }
    }

    /// Computes sum value of ([0, i)).
    fn sum(&self, i: usize) -> T {
        let mut idx = i as i64;
        let mut ret = T::default();
        while idx > 0 {
            ret += self.data[idx as usize];
            idx -= idx & (-idx);
        }
        ret
    }

    /// Adds value x into i-th position.
    fn add(&mut self, i: usize, x: T) {
        let mut idx = (i + 1) as i64;
        while idx < self.data.len() as i64 {
            self.data[idx as usize] += x;
            idx += idx & (-idx);
        }
    }

    fn range(&self, r: std::ops::Range<usize>) -> <T as std::ops::Sub>::Output {
        self.sum(r.end) - self.sum(r.start)
    }
}
// ===

fn solve(a: Vec<i64>) -> i64 {
    let n = a.len();

    let mut sum = vec![0; n+1];
    for i in 0..n {
        sum[i+1] = sum[i] + a[i];
    }
    let mut fenwick = FenwickTree::new(n*2+10, 0i64);
    let base = (n+5) as i64;
    let mut count = 0;
    for i in 0..n+1 {
        let l = sum[i];
        let want = (l + base) as usize; // -l to inf
        count += fenwick.range(0..want+1);
        // debug!(i, fenwick.range(0..want+1));
        fenwick.add((sum[i] + base) as usize, 1);
    }
    // debug!(a, count);
    let all = (n * (n + 1) / 2) as i64;
    ifv!(count >= (all+1)/2, 1, 0)
}

fn main() {
    input! {
        n: usize, a: [i64; n]
    };

    let mut b = a.clone();
    b.sort();
    let mut left = 0;
    let mut right = n;
    while right - left > 1 {
        let med = (right + left) / 2;
        let a = a.iter().cloned().map(|x| ifv!(x >= b[med], 1, -1)).collect::<Vec<_>>();
        if solve(a) == 1 {
            left = med;
        } else {
            right = med;
        }
    }
    println!("{}", b[left]);
}


Measured memory_bytes: 12540