def bubbleSort(a,n):
  flag = 1
  count = 0
  while flag:
    flag = 0
    for j in range(n-1,0,-1):
      if a[j] < a[j-1]:
        count += 1
        w = a[j]
        a[j] = a[j-1]
        a[j-1] = w
        flag = 1
  print(' '.join(map(str, a)))
  print(count)

n = int(input())
a = list(map(int, input().split()))
bubbleSort(a,n) def bubbleSort(a,n):
  flag = 1
  count = 0
  while flag:
    flag = 0
    for j in range(n-1,0,-1):
      if a[j] < a[j-1]:
        count += 1
        w = a[j]
        a[j] = a[j-1]
        a[j-1] = w
        flag = 1
  print(' '.join(map(str, a)))
  print(count) bubbleSort flag = 1 flag 1 count = 0 count 0 while flag:
    flag = 0
    for j in range(n-1,0,-1):
      if a[j] < a[j-1]:
        count += 1
        w = a[j]
        a[j] = a[j-1]
        a[j-1] = w
        flag = 1
   flag flag = 0 flag 0 for j in range(n-1,0,-1):
      if a[j] < a[j-1]:
        count += 1
        w = a[j]
        a[j] = a[j-1]
        a[j-1] = w
        flag = 1
   j range(n-1,0,-1) range n-1 n 1 0 -1 if a[j] < a[j-1]:
        count += 1
        w = a[j]
        a[j] = a[j-1]
        a[j-1] = w
        flag = 1
   a[j] < a[j-1] a[j] a j a[j-1] a j-1 j 1 count += 1 count 1 w = a[j] w a[j] a j a[j] = a[j-1] a[j] a j a[j-1] a j-1 j 1 a[j-1] = w a[j-1] a j-1 j 1 w flag = 1 flag 1 print(' '.join(map(str, a))) print ' '.join(map(str, a)) ' '.join ' ' join map(str, a) map str a print(count) print count a a n n n = int(input()) n int(input()) int input() input a = list(map(int, input().split())) a list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split bubbleSort(a,n) bubbleSort a n def bubbleSort(a,n):
  flag = 1
  count = 0
  while flag:
    flag = 0
    for j in range(n-1,0,-1):
      if a[j] < a[j-1]:
        count += 1
        w = a[j]
        a[j] = a[j-1]
        a[j-1] = w
        flag = 1
  print(' '.join(map(str, a)))
  print(count) def bubbleSort(a,n):
  flag = 1
  count = 0
  while flag:
    flag = 0
    for j in range(n-1,0,-1):
      if a[j] < a[j-1]:
        count += 1
        w = a[j]
        a[j] = a[j-1]
        a[j-1] = w
        flag = 1
  print(' '.join(map(str, a)))
  print(count) bubbleSort a = list(map(int, input().split())) list(map(int, input().split())) a n = int(input()) int(input()) n
def bubbleSort(a,n):
  flag = 1
  count = 0
  while flag:
    flag = 0
    for j in range(n-1,0,-1):
      if a[j] < a[j-1]:
        count += 1
        w = a[j]
        a[j] = a[j-1]
        a[j-1] = w
        flag = 1
  print(' '.join(map(str, a)))
  print(count)

n = int(input())
a = list(map(int, input().split()))
bubbleSort(a,n)
