int a;
int *b = &a;

#include<cstdio>
scanf printf
#include<cstring>
memset strlen strcmp
#include<ctime>
time(0)
#include<cstdlib>
rand() srand()
#include<iostream>
cin cout string
cin 关闭同步 std::ios::sync_with_stdio(false)//速度提高至scanf左右
#include<algorithm>
sort lower_bound max min
#include<cmath>
sqrt sin log pow

int read(){int x = 0,f = 1;char ch = getchars();while(ch < '0' || ch > '9'){if(ch == '-')f = -1;ch = getchars();}    while(ch >= '0' && ch <='9'){x = x * 10 + ch - '0';ch = getchars();    }return x * f;
}
//
fread

for(int i = 0;i<n - 1;i++)for(int j = i + 1;j < n;j++)if(a[j] < a[i])swap(a[j],a[i]);

for(i = 1;i < n;i++)for(j = 0;j < i;j++)if(a[j] > a[i])swap(a[i],a[j]);

for(int i = 0;i < n - 1;i++)for(int j = 0;j < n - 1 - i;j++)if(a[j] > a[j + 1])swap(a[j],a[j + 1]);

#include<cstdio>
#define sev en
using namespace std;
#define N 500010int a[N],n,f[N];
long long ans;void merge(int l,int r) {if(l == r)return ;int mid = (l + r) >> 1;merge(l,mid);merge(mid + 1,r);int i = l,k = l,j = mid + 1;while(i <= mid && j <= r) {if(a[i] <= a[j]) {f[k] = a[i];i++;k++;} else {f[k] = a[j];j++;k++;ans += mid - i + 1;}}while(i <= mid) {f[k] = a[i];i++;k++;}while(j <= r) {f[k] = a[j];k++;j++;}for(int w = l; w <= r; w++)a[w] = f[w];
}int main() {scanf("%d",&n);for(int i = 1; i <= n; i++)scanf("%d",&a[i]);merge(1,n);printf("%lld",ans);return 0;
}

for(i = 1;i <= n;i++){scanf("%d",&x); a[x]++;
}
for(i = 0;i <= n;i++)   for(j = 1;j <= a[i];j++) printf("%d ",i);

void quicksort(int p,int q){int i = p;int j = q;int temp = a[p];while(i < j){while(a[j] >= temp && j > i )j--;if(j > i){a[i] = a[j];i++;while(a[i] <= temp && i < j )i++;if(i < j){a[j] = a[i];j--;}}        }if(p < i - 1)quicksort(p,i - 1);if(j + 1 < q )quicksort(j + 1,q);
}

sort(a + 1,a + n + 1);

#include<vector>
push_back();
pop_back();
size();
empty();
clear();
erease();
insert();
operator[];

#include<map>
map<string,string>a;
a[qaq] = 'qwq';

#include<set>
size();
begin();
end();
empty();
clear();

#include<queue>
push();
pop();
empty();
first();
////
priority_queue<int>q;//大根堆
priority_queue<int,vector<int>,greater<int> >q;//小根堆

#include<stack>
push();
pop();

for(int i = 1;i <= m;i++)scanf("%d%d%d",&x,&y,&w);map[x][y] = w;map[y][x] = w;
}

struct EDGE{int nxt,to,w;
}e[N << 1];
int head[N],cnt;void add(int x,int y,int z){e[++cnt].to = y;e[cnt].nxt = head[x];e[cnt].w = z;head[x] = cnt;
}