#include<bits/stdc++.h>

using namespace std;

const int N=2e5+;

int n,m,qid,a[N],b[N],ans[N];

struct rec{

    int x,y,z,aid;  //位置，插入/删除，值，答案下标

    bool operator < (const rec &rhs) const {

        return x<rhs.x;

    }

}Q[N],tmp[N];

int sum[N];

void update(int x,int v) {

    for (;x<=n;x+=x&-x) sum[x]+=v;

}

int query(int x) {

    int ret=;

    for (;x;x-=x&-x) ret+=sum[x];

    return ret;

} 

void CDQ(int l,int r) {

    if (l>=r) return;

    int mid=l+r>>;

    CDQ(l,mid); CDQ(mid+,r);

    int p=l,q=mid+,o=l-;

    while (p<=mid || q<=r)  //归并排序结果

        if (q>r || p<=mid && Q[p]<Q[q]) tmp[++o]=Q[p++]; else tmp[++o]=Q[q++];

    p=l; q=mid+;

    while (p<=mid || q<=r)  //正向算逆序对

        if (q>r || p<=mid && Q[p]<Q[q]) update(Q[p].z,Q[p].y),p++;

        else ans[Q[q].aid]+=Q[q].y*(query(n)-query(Q[q].z)),q++;

    for (int i=l;i<=mid;i++) update(Q[i].z,-Q[i].y);

    p=mid; q=r;

    while (p>=l || q>mid)  //反向算逆序对

        if (q<=mid || p>=l && Q[q]<Q[p]) update(Q[p].z,Q[p].y),p--;

        else ans[Q[q].aid]+=Q[q].y*(query(Q[q].z-)),q--;

    for (int i=l;i<=mid;i++) update(Q[i].z,-Q[i].y);

    for (int i=l;i<=r;i++) Q[i]=tmp[i];

}

int main()

{

    cin>>n;

    for (int i=;i<=n;i++) scanf("%d",&a[i]),b[i]=a[i];

    sort(b+,b+n+);

    int t=unique(b+,b+n+)-(b+);

    for (int i=;i<=n;i++) a[i]=lower_bound(b+,b+t+,a[i])-b;

    for (int i=;i<=n;i++) Q[++qid]=(rec){i,,a[i],};

    cin>>m;

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

        int x,y; scanf("%d%d",&x,&y);

        Q[++qid]=(rec){x,-,a[x],i};

        Q[++qid]=(rec){x,,a[y],i};

        Q[++qid]=(rec){y,-,a[y],i};

        Q[++qid]=(rec){y,,a[x],i};

        swap(a[x],a[y]);

    }    

    CDQ(,qid);

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

        if (i) ans[i]+=ans[i-];

        printf("%d\n",ans[i]);

    }

    return ;

}