n=int(input())
a=list(map(int,input().split()))
x=y=z=0
for i in range(1,n):
    x+=1
    for j in range(n-1,i-1,-1):
        y+=1
        if a[j]<a[j-1]:
            a[j],a[j-1]=a[j-1],a[j]
            z+=1
for i in a:
    print(i,end=" ")
print()
print(x,y,z)

#include<bits/stdc++.h> using namespace std; const int Maxn=1010; int a[Maxn],n; int main() { cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; } int num=0; for(int i=1;i<=n-1;i++){ for(int j=n-1;j>=i;j--){ if(a[j]>a[j+1]){ swap(a[j],a[j+1]); num+=1; } } } for(int i=1;i<=n;i++){ cout<<a[i]<<" ";

}
cout<<endl;
cout<<n-1<<" "<<n*(n-1)/2<<" "<<num<<endl;
return 0;

}

低能排序

n = int(input())
l = list(map(int,input().split()))
cnt1,cnt2,cnt3 = 0,0,0
for i in range(n):
    cnt3+=1
    for j in range(n-1,i,-1):
        cnt1+=1
        if l[j-1]>l[j]:
            l[j-1],l[j] = l[j],l[j-1]
            cnt2+=1
for i in l:
    print(i,end = " ")
print()
print(cnt3-1,cnt1,cnt2)

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int n,k,c,d=0,l=0;
	cin>>n;
	k=n-1;
	int a[n+1];
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
	}
	while(k!=0)
	{
		for(int i=1;i<=k;i++)
		{
			d++;
			if(a[i]>a[i+1])
			{
//				c=a[i];
//				a[i]=a[i+1];
//				a[i+1]=c;
				swap(a[i],a[i+1]);
				l++;
			}
		}
		k--;
	}
	for(int i=1;i<=n;i++)
	{
		cout<<a[i]<<" ";
	}
	cout<<endl;
	cout<<n-1<<" "<<d<<" "<<l;
}