code:
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
//冒泡排序
int main(){
int i,j;
int n,head=1;
int a[100055];
int k,s;
cin>>n;
for(i=1;i<=n;i++){
cin>>a[i];
}
/*
while(head<=n){
for(i=head+1;i<=n;i++){
if(a[head]>a[i]) swap(a[head],a[i]);
}
head++;
}
*/
for(i=1;i<=n;i++){
for(j=i+1;j<=n;j++){
if(a[i]>a[j]){
swap(a[i],a[j]);
k=(j-i)*2;
s+=k;
}
}
}
cout<<s;
return 0;
}