const maxs=100000;
maxb=300000;
maxn=20000;
var j,root,ktt,tt,top,ans,p,m,i,x,y,temp,tx,ty:longint;
kl,kr,kls,krs,krt:array[1..maxs]of longint;
stack,s,l,r,n:array[0..maxb]of longint;
d:array[1..maxn]of longint;
procedure out(x:longint); forward;
procedure allot(var x:longint);
begin
if top=0
then begin
inc(tt); x:=tt;
n[x]:=0; s[x]:=0;
l[x]:=0; r[x]:=0;
end
else begin
x:=stack[top];
dec(top);
end;
end;
procedure recyc(x:longint);
begin
inc(top);
stack[top]:=x;
l[x]:=0; r[x]:=0;
end;
procedure zig(var x:longint);
var y:longint;
begin
y:=l[x]; l[x]:=r[y]; r[y]:=x;
s[y]:=s[x]; s[x]:=s[l[x]]+s[r[x]]+1;
x:=y;
end;
procedure zag(var x:longint);
var y:longint;
begin
y:=r[x]; r[x]:=l[y]; l[y]:=x;
s[y]:=s[x]; s[x]:=s[l[x]]+s[r[x]]+1;
x:=y;
end;
procedure maintain(var x:longint; flag:boolean);
begin
if flag
then if s[l[l[x]]]>s[r[x]] then zig(x)
else if s[r[l[x]]]>s[l[x]]
then begin zag(l[x]); zig(x); end
else exit
else if s[r[r[x]]]>s[l[x]] then zag(x)
else if s[l[r[x]]]>s[r[x]]
then begin zig(r[x]); zag(x); end
else exit;
maintain(l[x],true); maintain(r[x],false);
maintain(x,true); maintain(x,false);
end;
procedure insert(var x:longint; v:longint);
begin
if x=0
then begin
allot(x);
n[x]:=v; s[x]:=1;
end
else begin
inc(s[x]);
if v<=n[x]
then insert(l[x],v)
else insert(r[x],v);
maintain(x,v<=n[x]);
end;
end;
function delete(var x:longint; v:longint):longint;
var temp:longint;
begin
dec(s[x]);
if (v=n[x])or(v<n[x])and(l[x]=0)or(v>n[x])and(r[x]=0)
then begin
delete:=n[x];
if (l[x]=0)or(r[x]=0)
then begin
temp:=x;
x:=l[x]+r[x];
recyc(temp);
end
else n[x]:=delete(l[x],n[x]+1);
end
else if v<n[x]
then delete:=delete(l[x],v)
else delete:=delete(r[x],v);
end;
function rank(x,v:longint):longint;
begin
if x=0
then rank:=1
else if v<=n[x]
then rank:=rank(l[x],v)
else rank:=rank(r[x],v)+s[l[x]]+1;
end;
function select(x,k:longint):longint;
begin
if s[l[x]]+1=k
then select:=n[x]
else if k<=s[l[x]]
then select:=select(l[x],k)
else select:=select(r[x],k-s[l[x]]-1);
end;
procedure build(a,b:longint);
var mid,x,i:longint;
begin
inc(ktt); x:=ktt;
kl[x]:=a; kr[x]:=b;
if b-a>1
then begin
mid:=(a+b)shr 1;
kls[x]:=ktt+1; build(a,mid);
krs[x]:=ktt+1; build(mid,b);
end;
for i:=a+1 to b do
insert(krt[x],d[i]);
end;
function change(x,a,b:longint):longint;
var mid,temp:longint;
begin
if (a-1=kl[x])and(a=kr[x])
then begin
change:=n[krt[x]];
n[krt[x]]:=b;
end
else begin
mid:=(kl[x]+kr[x])shr 1;
if a<=mid
then temp:=change(kls[x],a,b)
else temp:=change(krs[x],a,b);
delete(krt[x],temp);
insert(krt[x],b);
//out(krt[x]); writeln;
change:=temp;
end;
end;
function getans(x,a,b,c:longint):longint;
var mid,temp:longint;
begin
if (a<=kl[x])and(kr[x]<=b)
then begin
temp:=rank(krt[x],c);
getans:=temp;
end
else begin
getans:=1;
mid:=(kl[x]+kr[x])shr 1;
if a<mid then getans:=
getans+getans(kls[x],a,b,c)-1;
if b>mid then getans:=
getans+getans(krs[x],a,b,c)-1;
end;
end;
procedure out(x:longint);
begin
if x=0 then exit;
out(l[x]);
write(n[x]);
out(r[x]);
end;
begin
assign(input,'queue.in'); reset(input);
assign(output,'queue.out'); rewrite(output);
readln(p);
ans:=0; top:=0;
s[0]:=0; root:=0; tt:=0;
for i:=1 to p do
begin
read(d[i]);
insert(root,d[i]);
j:=rank(root,d[i]+1);
ans:=ans+i-j+1;
end;
writeln(ans);
readln;
ktt:=0;
s[0]:=0; root:=0; tt:=0;
build(0,p);
readln(m);
for i:=1 to m do
begin
readln(x,y);
if (x=y)or(d[x]=d[y])
then begin
writeln(ans);
continue;
end;
if x>y
then begin
temp:=x; x:=y;
y:=temp;
end;
{if i=6
then x:=x;}
tx:=getans(1,0,x-1,d[x]+1);
ty:=getans(1,0,x-1,d[y]+1);
ans:=ans-(x-1-tx+1)+(x-1-ty+1);
//out(krt[1]); writeln;
ty:=getans(1,0,y-1,d[y]+1);
change(1,x,d[y]);
change(1,y,d[x]);
tx:=getans(1,0,y-1,d[x]+1);
ans:=ans-(y-1-ty+1)+(y-1-tx+1);
if d[x]<d[y]
then begin
temp:=getans(1,x,y-1,d[y])
-getans(1,x,y-1,d[x]);
ans:=ans+temp;
end
else begin
temp:=getans(1,x,y-1,d[x])
-getans(1,x,y-1,d[y]);
ans:=ans-temp;
end;
temp:=d[x];
d[x]:=d[y];
d[y]:=temp;
writeln(ans);
//out(krt[1]); writeln;
end;
close(input); close(output);
end.