3325

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <math.h>
#include <climits>

//#pragma GCC optimize("O3, unroll-loops");

#include <list>
#include <map>
#include <set>
#include <queue>
#include <unordered_map>
#include <unordered_set>

//#include <chrono>
//#include <fstream>
//#include <bits/stdc++.h>

#define mp make_pair
#define pb push_back
#define eb emplace_back
#define x first
#define y second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define RFOR(i,b,a) for (int i = (b) - 1; i >= (a); i--)

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> veci;
typedef vector<bool> vecb;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;

const int INF_I = 1e9;
const ll INF_LL = 1e18;

int n;
veci a;
veci t;

void build(int c = 1, int tl = 0, int tr = n - 1) {
    if (tl == tr) {
        t[c] = int(a[tl] == 0);
        return;
    }
    int tm = (tl + tr) >> 1;
    build(c << 1, tl, tm);
    build((c << 1) + 1, tm + 1, tr);
    t[c] = t[c << 1] + t[(c << 1) + 1];
}

int Get(int l, int r, int c = 1, int tl = 0, int tr = n - 1) {
    if (l > r)
        return 0;
    if (tl == l && tr == r)
        return t[c];
    int tm = (tr + tl) >> 1;
    return
        Get(l, min(tm, r), c << 1, tl, tm)
        +
        Get(max(tm + 1, l), r, (c << 1) + 1, tm + 1, tr);
}

void Set(int val, int i, int c = 1, int tl = 0, int tr = n - 1) {
    if (tl == tr) {
        t[c] = val==0;
        return;
    }
    int tm = (tr + tl) >> 1;
    if (i <= tm)
        Set(val, i, c << 1, tl, tm);
    else
        Set(val, i, (c << 1) + 1, tm + 1, tr);
    t[c] = t[c << 1] + t[(c << 1) + 1];
}

int main() {
    /*ifstream cin("in.txt");
    ofstream cout("out.txt");
    auto start_time = chrono::high_resolution_clock::now();*/

    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);


    cin >> n;
    a.assign(n, 0);
    t.assign(n << 2, 0);
    FOR(i, 0, n)
        cin >> a[i];

    build();

    int q;
    cin >> q;
    while (q--) {
        char ch; int l, r;
        cin >> ch >> l >> r;
        if (ch == 'u')
            Set(r, --l);
        else
            cout << Get(--l, --r) << " ";
    }


    /*auto end_time = chrono::high_resolution_clock::now();
    chrono::duration<double> duration = end_time - start_time;
    cout << duration.count() << "\n";
    cin.close();
    cout.close();*/
    return 0;
}