#include <algorithm>
#include <iomanip>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <sstream>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i, n) _rep2(i, 0, n)
#define _rep2(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using i64 = long long;
template<class T>
bool chmin(T& a, const T& b) { return (b < a) ? (a = b, true) : false; }
template<class T>
bool chmax(T& a, const T& b) { return (b > a) ? (a = b, true) : false; }

template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}
template<typename T>string join(vector<T>&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;}
template<typename T>string join(vector<vector<T>>&vv){string s="\n";rep(i,vv.size())s+=join(vv[i])+"\n";return s;}
template<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;}

using S = i64;
using F = i64;

S op(S a, S b)
{
    return min(a, b);
}

S e()
{
    return 2e16;
}

S mapping(F f, S x)
{
    return f + x;
}

F composition(F f, F g)
{
    return f + g;
}

F id()
{
    return 0;
}

int main()
{
    int n;
    cin >> n;

    vector<S> a(n);
    cin >> a;

    lazy_segtree<S, op, e, F, mapping, composition, id> seg(a);

    int q;
    cin >> q;

    vector<S> ans;
    rep(i, q)
    {
        int k, l, r;
        S c;
        cin >> k >> l >> r >> c;
        l--;
        r--;
        if (k == 1)
        {
            // 区間加算をする
            seg.apply(l, r + 1, c);
        }
        else
        {
            // 区間最小値取得
            cerr << l << " " << r + 1 << endl;
            ans.push_back(seg.prod(l, r + 1));
        }
    }

    

    for(auto u : ans)
        cout << u << endl;

    return 0;
}