package contest200918; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class F { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(); long[] a = new long[n]; for(int i = 0;i < n;i++){ a[i] = nl(); } StarrySkyTreeL sst = new StarrySkyTreeL(a); for(int Q = ni();Q > 0;Q--){ int K = ni(); int l = ni()-1, r = ni()-1, c = ni(); if(K == 1){ sst.add(l, r+1, c); }else{ out.println(sst.min(l, r+1)); } } } public static class StarrySkyTreeL { public int M, H, N; public long[] st; public long[] plus; public long I = Long.MAX_VALUE/4; // I+plus>>1; st = new long[M]; plus = new long[H]; } public StarrySkyTreeL(long[] a) { N = a.length; M = Integer.highestOneBit(Math.max(N-1, 1))<<2; H = M>>>1; st = new long[M]; for(int i = 0;i < N;i++){ st[H+i] = a[i]; } plus = new long[H]; Arrays.fill(st, H+N, M, I); for(int i = H-1;i >= 1;i--)propagate(i); } private void propagate(int i) { st[i] = Math.min(st[2*i], st[2*i+1]) + plus[i]; } public void add(int l, int r, long v){ if(l < r)add(l, r, v, 0, H, 1); } private void add(int l, int r, long v, int cl, int cr, int cur) { if(l <= cl && cr <= r){ if(cur >= H){ st[cur] += v; }else{ plus[cur] += v; propagate(cur); } }else{ int mid = cl+cr>>>1; if(cl < r && l < mid){ add(l, r, v, cl, mid, 2*cur); } if(mid < r && l < cr){ add(l, r, v, mid, cr, 2*cur+1); } propagate(cur); } } public long min(int l, int r){ return l >= r ? I : min(l, r, 0, H, 1);} private long min(int l, int r, int cl, int cr, int cur) { if(l <= cl && cr <= r){ return st[cur]; }else{ int mid = cl+cr>>>1; long ret = I; if(cl < r && l < mid){ ret = Math.min(ret, min(l, r, cl, mid, 2*cur)); } if(mid < r && l < cr){ ret = Math.min(ret, min(l, r, mid, cr, 2*cur+1)); } return ret + plus[cur]; } } public void fall(int i) { if(i < H){ if(2*i < H){ plus[2*i] += plus[i]; plus[2*i+1] += plus[i]; } st[2*i] += plus[i]; st[2*i+1] += plus[i]; plus[i] = 0; } } public int firstle(int l, long v) { if(l >= H)return -1; int cur = H+l; for(int i = 1, j = Integer.numberOfTrailingZeros(H)-1;i <= cur;j--){ fall(i); i = i*2|cur>>>j&1; } while(true){ fall(cur); if(st[cur] <= v){ if(cur >= H)return cur-H; cur = 2*cur; }else{ cur++; if((cur&cur-1) == 0)return -1; cur = cur>>>Integer.numberOfTrailingZeros(cur); } } } public int lastle(int l, long v) { if(l < 0)return -1; int cur = H+l; for(int i = 1, j = Integer.numberOfTrailingZeros(H)-1;i <= cur;j--){ fall(i); i = i*2|cur>>>j&1; } while(true){ fall(cur); if(st[cur] <= v){ if(cur >= H)return cur-H; cur = 2*cur+1; }else{ if((cur&cur-1) == 0)return -1; cur = cur>>>Integer.numberOfTrailingZeros(cur); cur--; } } } public void addx(int l, int r, long v){ if(l >= r)return; while(l != 0){ int f = l&-l; if(l+f > r)break; if(f == 1){ st[(H+l)/f] += v; }else{ plus[(H+l)/f] += v; } l += f; } while(l < r){ int f = r&-r; if(f == 1){ st[(H+r)/f-1] += v; }else{ plus[(H+r)/f-1] += v; } r -= f; } } public long minx(int l, int r){ long lmin = I; if(l >= r)return lmin; if(l != 0){ for(int d = 0;H>>>d > 0;d++){ if(d > 0){ int id = (H+l-1>>>d); lmin += plus[id]; } if(l<<~d<0 && l+(1<>>d]; if(v < lmin)lmin = v; l += 1<>>d > 0;d++){ if(d > 0 && r < H)rmin += plus[H+r>>>d]; if(r<<~d<0 && l < r){ long v = st[(H+r>>>d)-1]; if(v < rmin)rmin = v; r -= 1<>>1, ret); toArray(2*cur+1, l+r>>>1, r, ret); for(int i = l;i < r;i++)ret[i] += plus[cur]; } return ret; } } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new F().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }