fn main() {
    input! {
        n: usize,
        w: [i64; n],
        m: usize,
        s: [i64; m],
    }
    let mut w = w;
    w.insert(0, 0);
    for i in 1..w.len() {
        w[i] += w[i - 1];
    }
    let mut s = s;
    s.insert(0, 0);
    for i in 1..s.len() {
        s[i] += s[i - 1];
    }
    let mut z = vec![];
    z.extend(w.iter().cloned());
    z.extend(s.iter().cloned());
    z.push(0);
    z.sort();
    z.dedup();
    let mut p = z.windows(2).map(|z| (0, 0, z[1] - z[0])).collect::<Vec<_>>();
    for w in w.chunks_exact(2) {
        let l = z.binary_search(&w[0]).unwrap();
        let r = z.binary_search(&w[1]).unwrap();
        p[l..r].iter_mut().for_each(|p| p.0 = 1);
    }
    for w in s.chunks_exact(2) {
        let l = z.binary_search(&w[0]).unwrap();
        let r = z.binary_search(&w[1]).unwrap();
        p[l..r].iter_mut().for_each(|p| p.1 = 1);
    }
    let ans = solve(&p);
    println!("{ans}");
}

fn solve(a: &[(u8, u8, i64)]) -> i64 {
    if a.is_empty() {
        return 0;
    }
    for i in 0..a.len() {
        if a[i].0 == 0 && a[i].1 == 0 {
            return solve(&a[..i]) + solve(&a[(i + 1)..]);
        }
        if i > 0 && a[i].0 != a[i - 1].0 && a[i].1 != a[i - 1].1 {
            return solve(&a[..i]) + solve(&a[i..]);
        }
    }
    let mut z = vec![a[0]];
    for a in a[1..].iter() {
        z.push(*a);
        let k = z.len();
        let a = z.iter().rev().take(3).map(|p| p.0).sum::<u8>();
        let b = z.iter().rev().take(3).map(|p| p.1).sum::<u8>();
        if (a, b) == (3, 1) {
            let p = z.pop().unwrap();
            let q = z.pop().unwrap();
            z[k - 3].2 += p.2 + q.2;
        }
        if (a, b) == (1, 3) {
            let p = z.pop().unwrap();
            let q = z.pop().unwrap();
            z[k - 3].2 += p.2 + q.2;
        }
    }
    let mut dp = vec![0; z.len() + 1];
    for i in (0..z.len()).rev() {
        let mut s = 0;
        let mut ok = [true; 2];
        for j in (i..z.len()).take(3) {
            s += z[j].2;
            ok[0] &= z[j].0 == 1;
            ok[1] &= z[j].1 == 1;
            if ok[0] || ok[1] {
                dp[i] = dp[i].max(s * s + dp[j + 1]);
            }
        }
    }
    dp[0]
}

// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
#[macro_export]
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)*}
    };
}

#[macro_export]
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)*}
    };
}

#[macro_export]
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, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------