1 /*************************************************************************
  2     > File Name: EQUAKE.cpp
  3     > Author: Stomach_ache
  4     > Mail: sudaweitong@gmail.com
  5     > Created Time: 2014年09月02日 星期二 22时05分51秒
  6     > Propose:
  7  ************************************************************************/
  8 #include <cmath>
  9 #include <string>
 10 #include <cstdio>
 11 #include <fstream>
 12 #include <cstring>
 13 #include <iostream>
 14 #include <algorithm>
 15 using namespace std;
 16 /*Let's fight!!!*/
 17
 18 #define lson(x) (x << 1)
 19 #define rson(x) ((x << 1) | 1)
 20 const int MAX_N = 800050;
 21 int A[MAX_N];
 22 struct node {
 23     int l, r;
 24     int cnt, var[12];
 25 }tr[MAX_N*4];
 26
 27 int rotate(int x, int k) {
 28     int arr[10], len = 0, res = 0, tmp = x;
 29     while (tmp) {
 30         tmp /= 10;
 31         len++;
 32     }
 33     for (int i = len-1; i >= 0; i--) arr[i] = x % 10, x /= 10;
 34     for (int i = k; i < len + k; i++) res = res * 10 + arr[i%len];
 35
 36     return res;
 37 }
 38
 39 void cal(int rt) {
 40     int tmp[12];
 41     for (int i = 0; i < 12; i++)
 42           tmp[i] = tr[rt].var[(i + tr[rt].cnt) % 12];
 43     for (int i = 0; i < 12; i++) tr[rt].var[i] = tmp[i];
 44 }
 45
 46 void pushdown(int rt) {
 47       if (tr[rt].cnt != 0) {
 48           cal(rt);
 49           if (tr[rt].l != tr[rt].r) {
 50             tr[lson(rt)].cnt += tr[rt].cnt;
 51             tr[rson(rt)].cnt += tr[rt].cnt;
 52             tr[lson(rt)].cnt %= 12;
 53             tr[rson(rt)].cnt %= 12;
 54         }
 55         tr[rt].cnt = 0;
 56     }
 57 }
 58
 59 void pushup(int rt) {
 60     for (int i = 0; i < 12; i++)
 61         tr[rt].var[i] = max(tr[lson(rt)].var[i], tr[rson(rt)].var[i]);
 62 }
 63
 64 void build(int rt, int L, int R) {
 65     tr[rt].l = L, tr[rt].r = R, tr[rt].cnt = 0;
 66     if (L == R) {
 67         for (int i = 0; i < 12; i++)
 68               tr[rt].var[i] = rotate(A[L], i);
 69         return ;
 70     }
 71     int mid = (L + R) / 2;
 72     build(lson(rt), L, mid);
 73     build(rson(rt), mid + 1, R);
 74     pushup(rt);
 75 }
 76
 77 void update(int rt, int L, int R, int v) {
 78     pushdown(rt);
 79     if (L > tr[rt].r || R < tr[rt].l) return ;
 80
 81       if (tr[rt].l >= L && tr[rt].r <= R) {
 82         tr[rt].cnt += v;
 83         tr[rt].cnt %= 12;
 84         pushdown(rt);
 85         return ;
 86     }
 87     int mid = tr[lson(rt)].r;
 88     update(lson(rt), L, R, v);
 89     update(rson(rt), L, R, v);
 90     pushup(rt);
 91 }
 92
 93 int query(int rt, int L, int R) {
 94     pushdown(rt);
 95     if (tr[rt].r < L || tr[rt].l > R) return -1;
 96       if (tr[rt].l >= L && tr[rt].r <= R) {
 97           return tr[rt].var[0];
 98     }
 99
100     int ql = query(lson(rt), L, R);
101     int qr = query(rson(rt), L, R);
102     return max(ql, qr);
103 }
104
105 int main(void) {
106     ios_base::sync_with_stdio(false);
107     int n, m;
108     cin >> n;
109     for (int i = 0; i < n; i++) cin >> A[i];
110     build(1, 0, n - 1);
111     cin >> m;
112     while (m--) {
113         int t;
114         cin >> t;
115         if (t == 0) {
116             int l, r, f;
117             cin >> l >> r >> f;
118             update(1, l, r, f);
119         } else {
120             int l, r;
121             cin >> l >> r;
122             cout << query(1, l, r) << endl;
123         }
124     }
125
126     return 0;
127 }