//https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 より
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_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_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")
    };
}

//

use std::io::Write;

struct Bucket {
    min: i64,
    add: i64,
    val: Vec<i64>,
}

impl Bucket {
    fn new(val: &[i64]) -> Self {
        Bucket {
            min: *val.iter().min().unwrap(),
            add: 0,
            val: val.iter().cloned().collect(),
        }
    }
    fn add(&mut self, l: usize, r: usize, v: i64) {
        assert!(l < r && r <= self.val.len());
        if (l, r) == (0, self.val.len()) {
            self.add += v;
            return;
        }
        for x in self.val[l..r].iter_mut() {
            *x += v;
        }
        self.min = *self.val.iter().min().unwrap();
    }
    fn find(&self, l: usize, r: usize) -> i64 {
        assert!(l < r && r <= self.val.len());
        if (l, r) == (0, self.val.len()) {
            self.min + self.add
        } else {
            *self.val[l..r].iter().min().unwrap() + self.add
        }
    }
}

fn run() {
    let out = std::io::stdout();
    let mut out = std::io::BufWriter::new(out.lock());
    input! {
        n: usize,
        a: [i64; n],
        q: usize,
        ask: [(u8, usize1, usize, i64); q],
    }
    let size = 316;
    let mut b = vec![];
    for a in a.chunks(size) {
        b.push(Bucket::new(a));
    }
    for (k, l, r, c) in ask {
        let mut res = std::i64::MAX;
        for (i, b) in b.iter_mut().enumerate() {
            let p = std::cmp::max(size * i, l);
            let q = std::cmp::min(size * (i + 1), r);
            if p >= q {
                continue;
            }
            let l = p - i * size;
            let r = q - i * size;
            if k == 1 {
                b.add(l, r, c);
            } else {
                res = std::cmp::min(res, b.find(l, r));
            }
        }
        if k == 2 {
            writeln!(out, "{}", res).ok();
        }
    }
}

fn main() {
    run();
}