Problem:
Score : 600 points

Problem Statement

Given is an integer sequence A_1, ..., A_N of length N.

We will choose exactly \left\lfloor \frac{N}{2} \right\rfloor elements from this sequence so that no two adjacent elements are chosen.

Find the maximum possible sum of the chosen elements.

Here \lfloor x \rfloor denotes the greatest integer not greater than x.

Constraints

2 \leq N \leq 2\times 10^5

|A_i|\leq 10^9

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
A_1 ... A_N

Output

Print the maximum possible sum of the chosen elements.

Sample Input 1

6
1 2 3 4 5 6

Sample Output 1

12

Choosing 2, 4, and 6 makes the sum 12, which is the maximum possible value.

Sample Input 2

5
-1000 -100 -10 0 10

Sample Output 2

0

Choosing -10 and 10 makes the sum 0, which is the maximum possible value.

Sample Input 3

10
1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000

Sample Output 3

5000000000

Watch out for overflow.

Sample Input 4

27
18 -28 18 28 -45 90 -45 23 -53 60 28 -74 -71 35 -26 -62 49 -77 57 24 -70 -93 69 -99 59 57 -49

Sample Output 4

295

Solution in Rust (1.42.0) (judge verdict: Wrong Answer)

pub struct Scanner {
    line: Vec<String>,
    idx: usize,
}

#[allow(dead_code)]
impl Scanner {
    fn new() -> Scanner {
        return Scanner {
            line: vec![],
            idx: 0,
        };
    }
    fn next<T: std::str::FromStr>(&mut self) -> T {
        if self.idx == self.line.len() {
            let mut buffer = String::new();
            std::io::stdin().read_line(&mut buffer).ok();
            let a: Vec<&str> = buffer.trim().split(' ').collect();
            self.line = a.iter().map(|&s| String::from(s)).collect();
            self.idx = 0;
        }
        let ret: T = self.line[self.idx].parse::<T>().ok().expect("Parse error.");
        self.idx += 1;
        ret
    }
    fn next_string(&mut self) -> Vec<char> {
        let s: String = self.next();
        return s.chars().collect::<Vec<char>>();
    }
    fn next_vec<T: std::str::FromStr>(&mut self, n: usize) -> Vec<T> {
        let mut v: Vec<T> = Vec::with_capacity(n);
        for _i in 0..n {
            v.push(self.next());
        }
        v
    }
}

#[allow(dead_code)]
fn gcd(a: u32, b: u32) -> u32 {
    if b == 0 {
        a
    } else {
        gcd(b, a % b)
    }
}

const MOD :u64 = 1_000_000_007;

#[allow(dead_code)]
fn pow(mut x: u64, mut y: u64) -> u64 {
    let mut r = 1;
    while y > 0{
        if (y&1) == 1{
            r = r*x%MOD;
        }
        y >>= 1;
        x = x*x%MOD;
    }
    r
}


fn main(){
    let mut scan = Scanner::new();
    let n:usize = scan.next();
    let a : Vec<i64> = scan.next_vec(n);
    let mut dp:Vec<Vec<i64>> = vec![vec![i64::min_value() / 2; 3]; n+2];

    let skip: usize;
    if n%2==0{
        skip = 1;
    }else{
        skip = 2;
    }
    dp[0][0] = 0;
    for i in 0..n{
        for j in 0..skip + 1 {
            if j < skip {
                dp[i + 1][j + 1] = std::cmp::max(dp[i + 1][j + 1], dp[i][j]);
            }
            dp[i + 2][j] = std::cmp::max(dp[i + 2][j], dp[i][j] + a[i]);
        }
    }
    let mut ans = 0;
    for i in 0..skip+1{
        ans = std::cmp::max(ans, dp[n][i]);
    }
    for i in 0..skip+1{
        ans = std::cmp::max(ans, dp[n + 1][i]);
    }
    println!("{}", ans);
}