// -*- coding:utf-8-unix -*-
// #![feature(map_first_last)]
#![allow(dead_code)]
#![allow(unused_imports)]
#![allow(unused_macros)]
// use core::num;
use std::cmp::*;
use std::fmt::*;
use std::hash::*;
use std::iter::FromIterator;
use std::*;
use std::{cmp, collections, fmt, io, iter, ops, str};
const INF: i64 = 1223372036854775807;
const UINF: usize = INF as usize;
const LINF: i64 = 2147483647;
const INF128: i128 = 1223372036854775807000000000000;
const MOD1: i64 = 1000000007;
const MOD9: i64 = 998244353;
const MOD: i64 = MOD9;
// const MOD: i64 = MOD2;
const UMOD: usize = MOD as usize;
const M_PI: f64 = 3.14159265358979323846;

// use proconio::input;
// const MOD: i64 = INF;

use cmp::Ordering::*;
use std::collections::*;

use std::io::stdin;
use std::io::stdout;
use std::io::Write;

macro_rules! p {
    ($x:expr) => {
        //if expr
        println!("{}", $x);
    };
}

macro_rules! vp {
    // vector print separate with space
    ($x:expr) => {
        println!(
            "{}",
            $x.iter()
                .map(|x| x.to_string())
                .collect::<Vec<_>>()
                .join(" ")
        );
    };
}

macro_rules! d {
    ($x:expr) => {
        eprintln!("{:?}", $x);
    };
}
macro_rules! yn {
    ($val:expr) => {
        if $val {
            println!("Yes");
        } else {
            println!("No");
        }
    };
}

macro_rules! map{
    // declear btreemap
    ($($key:expr => $val:expr),*) => {
        {
            let mut map = ::std::collections::BTreeMap::new();
            $(
                map.insert($key, $val);
            )*
            map
        }
    };
}

macro_rules! set{
    // declear btreemap
    ($($key:expr),*) => {
        {
            let mut set = ::std::collections::BTreeSet::new();
            $(
                set.insert($key);
            )*
            set
        }
    };
}

//input output
#[allow(dead_code)]
fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

#[allow(dead_code)]
fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}

#[allow(dead_code)]
fn read_mat<T: std::str::FromStr>(n: u32) -> Vec<Vec<T>> {
    (0..n).map(|_| read_vec()).collect()
}

#[allow(dead_code)]
fn readii() -> (i64, i64) {
    let mut vec: Vec<i64> = read_vec();
    (vec[0], vec[1])
}

#[allow(dead_code)]
fn readiii() -> (i64, i64, i64) {
    let mut vec: Vec<i64> = read_vec();
    (vec[0], vec[1], vec[2])
}
#[allow(dead_code)]
fn readuu() -> (usize, usize) {
    let mut vec: Vec<usize> = read_vec();
    (vec[0], vec[1])
}

#[allow(dead_code)]
fn readff() -> (f64, f64) {
    let mut vec: Vec<f64> = read_vec();
    (vec[0], vec[1])
}

fn readcc() -> (char, char) {
    let mut vec: Vec<char> = read_vec();
    (vec[0], vec[1])
}

fn readuuu() -> (usize, usize, usize) {
    let mut vec: Vec<usize> = read_vec();
    (vec[0], vec[1], vec[2])
}
#[allow(dead_code)]
fn readiiii() -> (i64, i64, i64, i64) {
    let mut vec: Vec<i64> = read_vec();
    (vec[0], vec[1], vec[2], vec[3])
}

#[allow(dead_code)]
fn readuuuu() -> (usize, usize, usize, usize) {
    let mut vec: Vec<usize> = read_vec();
    (vec[0], vec[1], vec[2], vec[3])
}

fn main() {
    let n: usize = read();
    let mut a: Vec<i64> = read_vec();
    let mut b: Vec<i64> = read_vec();
    let mut c: Vec<i64> = read_vec();
    let mut dp = vec![vec![-1 * INF; (10) as usize]; (n + 1) as usize];
    // 0 まだ焼いてない
    // 1 片面だけ焼き始めた区間
    // 2 両面焼き始めた区間
    // 3 1回目の片面だけ焼き終わった区間
    // 4 ２回目の片面を焼いてる区間
    // 5　焼き終わった区間
    dp[0][0] = 0;
    for i in 0..n {
        dp[i + 1][0] = max(dp[i + 1][0], dp[i][0]);
        dp[i + 1][1] = max(dp[i + 1][1], dp[i][0]);
        dp[i + 1][1] = max(dp[i + 1][1], dp[i][1]);
        dp[i + 1][2] = max(dp[i + 1][2], dp[i][0]);
        dp[i + 1][2] = max(dp[i + 1][2], dp[i][1]);
        dp[i + 1][2] = max(dp[i + 1][2], dp[i][2]);
        dp[i + 1][3] = max(dp[i + 1][3], dp[i][1]);
        dp[i + 1][3] = max(dp[i + 1][3], dp[i][3]);
        dp[i + 1][4] = max(dp[i + 1][4], dp[i][2]);
        dp[i + 1][4] = max(dp[i + 1][4], dp[i][3]);
        dp[i + 1][4] = max(dp[i + 1][4], dp[i][4]);
        dp[i + 1][5] = max(dp[i + 1][5], dp[i][0]);
        dp[i + 1][5] = max(dp[i + 1][5], dp[i][1]);
        dp[i + 1][5] = max(dp[i + 1][5], dp[i][2]);
        dp[i + 1][5] = max(dp[i + 1][5], dp[i][3]);
        dp[i + 1][5] = max(dp[i + 1][5], dp[i][4]);
        dp[i + 1][5] = max(dp[i + 1][5], dp[i][5]);

        dp[i + 1][0] += a[i];
        dp[i + 1][1] += b[i];
        dp[i + 1][2] += c[i];
        dp[i + 1][3] += a[i];
        dp[i + 1][4] += b[i];
        dp[i + 1][5] += a[i];
        // d!(dp[i + 1]);
    }
    let mut ans = 0;
    for i in 0..6 {
        ans = max(ans, dp[n][i]);
    }
    p!(ans);

    return;
}