소스 코드 제출

# import sys

# sys.setrecursionlimit(10**6)

#

#

# def bs(s, e, k):

# global a, n

# if s == e:

# return s+1

# mid = int((s + e) / 2)

# if a[mid] >= k:

# return bs(s, mid, k)

# else:

# return bs(mid+1, e, k)

#

#

# n, m = map(int, input().split())

# a = list(map(int, input().split()))

# if a[-1] < m:

# print(n+1)

# else:

# print(bs(0, n-1, m))

a = [1000]

cnt = 0

n = int(input())

b = list(map(int, input().split()))

for i in range(n):

a.append(b[i])

for i in range(n-1):

check = 0

for j in range(n-i):

if a[j] > a[j + 1]:

temp = a[j]

a[j] = a[j + 1]

a[j + 1] = temp

check = 1

cnt += 1

print(check)

if check == 0:

break

print(cnt)