#include <iostream>
#include <vector>
#include <string>
#include <iomanip>
#include <queue>
#include <cmath>
#include <algorithm>
#include <tuple>
#include <iomanip>
#include <stdio.h>
#include <numeric>
#include <map>
#include <bitset>
#include <set>
#include <stack>
#include <queue>
#include <unordered_set>


//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("section-anchors")
//#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
//#pragma GCC optimize("vpt")
//#pragma GCC optimize("rename-registers")
//#pragma GCC optimize("move-loop-invariants")
//#pragma GCC optimize("unswitch-loops")
//#pragma GCC optimize("function-sections")
//#pragma GCC optimize("data-sections")
//#pragma GCC optimize("branch-target-load-optimize")
//#pragma GCC optimize("branch-target-load-optimize2")
//#pragma GCC optimize("btr-bb-exclusive")
//#pragma GCC optimize("O0")


#define int long long
#define ll long long
#define ull unsigned long long
#define all(a) a.begin(), a.end()
#define pii pair<int, int>
#define pb push_back
#define ld long double


using namespace std;

const int INF = 1e18;
//const int mod = 2600000069;
//const int p = 179;

struct node {
    int l, r, lm, rm, ans;
    node(int l_, int lm_, int r_, int rm_, int ans_) {
        l = l_;
        lm = lm_;
        r = r_;
        rm = rm_;
        ans = ans_;
    }
    node() {
        l = 0;
        r = 0;
        rm = INF;
        lm = INF;
        ans = 0;
    }
};

node merge(node a, node b, int l, int m, int r) {
    node c;
    c.l = a.l;
    c.lm = a.lm;
    c.r = b.r;
    c.rm = b.rm;
    c.ans = max(a.ans, b.ans);
    if (a.r + a.rm == b.lm) {
        c.ans = max(a.r + b.l, c.ans);
    }
    if (a.l == m - l && a.l + a.lm == b.lm) {
        c.l = a.l + b.l;
    }
    if (b.r == r - m && a.rm + a.r == b.rm) {
        c.r = a.r + b.r;
        c.rm = a.rm;
    }
    c.ans = max(c.ans, max(c.l, c.r));
    return c;
}

int n;
vector<node> t;
vector<int> a, mod;

void push(int v) {
    if (2 * v + 1 >= 4 * n) {
        t[v].lm += mod[v];
        t[v].rm += mod[v];
        mod[v] = 0;
        return;
    }
    t[v].lm += mod[v];
    t[v].rm += mod[v];
    mod[2 * v + 1] += mod[v];
    mod[2 * v + 2] += mod[v];
    mod[v] = 0;
}

void build(int v, int l, int r) {
    if (r - l == 1) {
        t[v] = node(1, a[l], 1, a[l], 1);
        return;
    }
    int m = (l + r) / 2;
    build(2 * v + 1, l, m);
    build(2 * v + 2, m, r);
    t[v] = merge(t[2 * v + 1], t[2 * v + 2], l, m, r);
}

void update(int v, int l, int r, int askl, int askr, int val) {
    if (l >= askr || r <= askl) {
        return;
    }
    push(v);
    if (l >= askl && r <= askr) {
        mod[v] = val;
        return;
    }
    int m = (l + r) / 2;
    update(2 * v + 1, l, m, askl, askr, val);
    update(2 * v + 2, m, r, askl, askr, val);
    t[v] = merge(t[2 * v + 1], t[2 * v + 2], l, m, r);
}

node get_ans(int v, int l, int r, int askl, int askr) {
    if (l >= askr || r <= askl) return node();
    push(v);
    if (l >= askl && r <= askr) {
        return t[v];
    }
    int m = (l + r) / 2;
    node ret = merge(get_ans(2 * v + 1, l, m, askl, askr), get_ans(2 * v + 2, m, r, askl, askr), l, m, r);
    t[v] = merge(t[2 * v + 1], t[2 * v + 2], l, m, r);
    return ret;
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    a.resize(n);
    t.resize(4 * n);
    mod.assign(4 * n, 0);
    for (auto& k : a) cin >> k;
    build(0, 0, n);
    int q;
    cin >> q;
    char t;
    int l, r, val;
    while (q--) {
        cin >> t >> l >> r;
        --l;
        if (t == '+') {
            cin >> val;
            update(0, 0, n, l, r, val);
        } else {
            cout << get_ans(0, 0, n, l, r).ans << "\n";
        }
    }
}