#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
const ll MOD=1000000007;
const ll LINF=1ll<<60;
const int INF=1<<30;
int dx[]={1,0,-1,0,1,-1,1,-1};
int dy[]={0,1,0,-1,1,-1,-1,1};


template< typename T >
struct SegmentTree{
    private:
        int n;
        vector<T> segMin;
        vector<T> segAdd;
 
    public:
        SegmentTree(int sz){
            n = 1;
            while(n < sz) n *= 2;
            segMin.resize(2*n-1, 0);
            segAdd.resize(2*n-1, 0);
        }
 
        void add(int a, int b, T x, int k, int l, int r) {
            if (r <= a || b <= l) return;
            if (a <= l && r <= b){
                segAdd[k] += x;
                return;
            }
            add(a, b, x, k * 2 + 1, l, (l + r) / 2);
            add(a, b, x, k * 2 + 2, (l + r) / 2, r);
            segMin[k] = min(segMin[k * 2 + 1] + segAdd[k * 2 + 1], segMin[k * 2 + 2] + segAdd[k * 2 + 2]);
        }
 
        void add(int a,int b, T x) {
            add(a, b, x, 0, 0, n);
        }
 
        T getMin(int a, int b, int k, int l, int r) {
            if (r <= a || b <= l) return LINF;
            if (a <= l && r <= b) return (segMin[k] + segAdd[k]);
            T left = getMin(a, b, k * 2 + 1, l, (l + r) / 2);
            T right = getMin(a, b, k * 2 + 2, (l + r) / 2, r);
            return (min(left, right) + segAdd[k]);
        }
 
        T getMin(int a,int b){
            return getMin(a, b, 0, 0, n);
        }
};


int main(){
    int n;cin >> n;
    vector<ll> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    SegmentTree<ll> seg(n);
    for (int i = 0; i < n; i++) {
        seg.add(i, i+1, a[i]);
    }
    int q;cin >> q;
    while(q--){
        int t;cin >> t;
        if(t == 1){
            ll l,r,x;cin >> l >> r >> x;
            seg.add(l-1, r, x);
        }
        else{
            ll l,r,x;cin >> l >> r >> x;
            cout << seg.getMin(l-1, r) << endl;
        }
    }
    return 0;
}