#include <bits/stdc++.h>
using namespace std;
long long segMin[1 << 19], segAdd[1 << 19];
int n;
void add(int a, int b, int x, int k = 0, int l = 0, int r = n) {
  if (r <= a || b <= l) return;
  if (a <= l && r <= b) {
    segAdd[k] += x;
    while (k) {
      k = (k - 1) / 2;
      segMin[k] = min(segMin[k * 2 + 1] + segAdd[k * 2 + 1],
                      segMin[k * 2 + 2] + segAdd[k * 2 + 2]);
    }
    return;
  }
  add(a, b, x, k * 2 + 1, l, (l + r) / 2);
  add(a, b, x, k * 2 + 2, (l + r) / 2, r);
}
long long getMin(int a, int b, int k = 0, int l = 0, int r = n) {
  if (r <= a || b <= l) return (LLONG_MAX);
  if (a <= l && r <= b) return (segMin[k] + segAdd[k]);
  long long left = getMin(a, b, k * 2 + 1, l, (l + r) / 2);
  long long right = getMin(a, b, k * 2 + 2, (l + r) / 2, r);
  return (min(left, right) + segAdd[k]);
}
int main(int argc, char const* argv[]) {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    int t;
    scanf("%d", &t);
    add(i, i + 1, t);
  }
  int m;
  scanf("%d", &m);
  getchar();
  for (int i = 0; i < m; i++) {
    int arg[3];
    char query[256], *p;
    int idx = 0;
    fgets(query, 256, stdin);
    p = strtok(query, " \n");
    while (p != NULL) {
      arg[idx++] = atoi(p);
      p = strtok(NULL, " \n");
    }
    if (idx == 2) {
      printf("%lld\n", arg[0] <= arg[1]
                           ? getMin(arg[0], arg[1] + 1)
                           : min(getMin(arg[0], n), getMin(0, arg[1] + 1)));
    } else {
      if (arg[0] <= arg[1]) {
        add(arg[0], arg[1] + 1, arg[2]);
      } else {
        add(arg[0], n, arg[2]);
        add(0, arg[1] + 1, arg[2]);
      }
    }
  }
  return 0;
}
