#include<iostream>

#include<cstdio>

#include<cmath>

#include<cstdlib>

#include<cstring>

#include<algorithm>

using namespace std;

#define ll long long

#define N 100010

char getc(){char c=getchar();while ((c<'A'||c>'Z')&&(c<'a'||c>'z')&&(c<''||c>'')) c=getchar();return c;}

int gcd(int n,int m){return m==?n:gcd(m,n%m);}

int read()

{

    int x=,f=;char c=getchar();

    while (c<''||c>'') {if (c=='-') f=-;c=getchar();}

    while (c>=''&&c<='') x=(x<<)+(x<<)+(c^),c=getchar();

    return x*f;

}

int n,m,a[N];

struct data{int f[][][][],l,r,sum;ll ans;

}tree[N<<];

data merge(data x,data y)

{

    data p;memset(p.f,,sizeof(p.f));

    p.l=x.l,p.r=y.r;

    p.sum=x.sum+y.sum;

    p.ans=x.ans+y.ans;

    for (int i=;i<;i++)

    {

        int s1=,s2=;

        for (int j=;j<;j++)

            for (int k=;k<;k++)

            s1+=x.f[][i][j][k],s2+=y.f[][i][j][k];

        p.ans+=1ll*s1*s2;

    }

    for (int i=;i<;i++)

        for (int j=-i;j<;j++)

            for (int u=;u<;u++)

                for (int v=;v<;v++)

                if (u|v) p.ans+=1ll*x.f[][][u][i]*y.f[][][v][j]+1ll*x.f[][][u][i]*y.f[][][v][j];

    int lone=x.sum,lzero=x.r-x.l+-lone,rone=y.sum,rzero=y.r-y.l+-rone;

    for (int i=;i<;i++)

        for (int j=;j<;j++)

            for (int k=;k<;k++)

            p.f[][i][j][k]+=x.f[][i][j][k],p.f[][i^(lone&)][lone+i>=||j][min(,lzero+k)]+=y.f[][i][j][k],

            p.f[][i][j][k]+=y.f[][i][j][k],p.f[][i^(rone&)][rone+i>=||j][min(,rzero+k)]+=x.f[][i][j][k];

    return p;

}

void newpoint(int k,int x)

{

    memset(tree[k].f,,sizeof(tree[k].f));

    tree[k].f[][x][][x^]=tree[k].f[][x][][x^]=;tree[k].ans=x^;tree[k].sum=x;

}

void build(int k,int l,int r)

{

    tree[k].l=l,tree[k].r=r;

    if (l==r){newpoint(k,a[l]);return;}

    int mid=l+r>>;

    build(k<<,l,mid);

    build(k<<|,mid+,r);

    tree[k]=merge(tree[k<<],tree[k<<|]);

}

void modify(int k,int p,int x)

{

    if (tree[k].l==tree[k].r) {newpoint(k,x);return;}

    int mid=tree[k].l+tree[k].r>>;

    if (p<=mid) modify(k<<,p,x);

    else modify(k<<|,p,x);

    tree[k]=merge(tree[k<<],tree[k<<|]);

}

data query(int k,int l,int r)

{

    if (tree[k].l==l&&tree[k].r==r) return tree[k];

    int mid=tree[k].l+tree[k].r>>;

    if (r<=mid) return query(k<<,l,r);

    else if (l>mid) return query(k<<|,l,r);

    else return merge(query(k<<,l,mid),query(k<<|,mid+,r));

}

int main()

{

#ifndef ONLINE_JUDGE

    freopen("bzoj5294.in","r",stdin);

    freopen("bzoj5294.out","w",stdout);

    const char LL[]="%I64d\n";

#else

    const char LL[]="%lld\n";

#endif

    n=read();

    for (int i=;i<=n;i++) a[i]=read();

    build(,,n);

    m=read();

    while (m--)

    {

        int op=read();

        if (op==)

        {

            int x=read();

            modify(,x,a[x]^=);

        }

        else

        {

            int l=read(),r=read();

            printf(LL,query(,l,r).ans);

        }

    }

    return ;

}