def insertionSort(A, n, g):
    global cnt
    for i in range(g, n):
        v = A[i]
        j = i - g
        while j >= 0 and A[j] > v:
            A[j+g] = A[j]
            j = j - g
            cnt += 1
        A[j+g] = v

n = int(input())
A = [int(input()) for _ in range(n)]
cnt = 0
G = [int(pow(4, i) + 3*pow(2, i-1) + 1) for i in range(10)[::-1]] + [1]
G = [v for v in G if v <= n]
m = len(G)
for i in range(m):
    insertionSort(A, n, G[i])
print(m)
print(*G)
print(cnt)
print(*A, sep='\n') def insertionSort(A, n, g):
    global cnt
    for i in range(g, n):
        v = A[i]
        j = i - g
        while j >= 0 and A[j] > v:
            A[j+g] = A[j]
            j = j - g
            cnt += 1
        A[j+g] = v insertionSort global cnt for i in range(g, n):
        v = A[i]
        j = i - g
        while j >= 0 and A[j] > v:
            A[j+g] = A[j]
            j = j - g
            cnt += 1
        A[j+g] = v i range(g, n) range g n v = A[i] v A[i] A i j = i - g j i - g i g while j >= 0 and A[j] > v:
            A[j+g] = A[j]
            j = j - g
            cnt += 1
         j >= 0 and A[j] > v j >= 0 j 0 A[j] > v A[j] A j v A[j+g] = A[j] A[j+g] A j+g j g A[j] A j j = j - g j j - g j g cnt += 1 cnt 1 A[j+g] = v A[j+g] A j+g j g v A A n n g g n = int(input()) n int(input()) int input() input int(input()) for _ in range(n) for _ in range(n) _ range(n) range n for _ in range(n) int(input()) int input() input A = [int(input()) for _ in range(n)] A [int(input()) for _ in range(n)] cnt = 0 cnt 0 int(pow(4, i) + 3*pow(2, i-1) + 1) for i in range(10)[::-1] for i in range(10)[::-1] i range(10)[::-1] (10) range 10 ::-1 -1 for i in range(10)[::-1] int(pow(4, i) + 3*pow(2, i-1) + 1) int pow(4, i) + 3*pow(2, i-1) + 1 pow(4, i) + 3*pow(2, i-1) pow(4, i) pow 4 i 3*pow(2, i-1) 3 pow(2, i-1) pow 2 i-1 i 1 1 G = [int(pow(4, i) + 3*pow(2, i-1) + 1) for i in range(10)[::-1]] + [1] G [int(pow(4, i) + 3*pow(2, i-1) + 1) for i in range(10)[::-1]] + [1] [int(pow(4, i) + 3*pow(2, i-1) + 1) for i in range(10)[::-1]] [1] 1 v for v in G if v <= n for v in G if v <= n v G v <= n v n if v <= n v G = [v for v in G if v <= n] G [v for v in G if v <= n] m = len(G) m len(G) len G for i in range(m):
    insertionSort(A, n, G[i]) i range(m) range m insertionSort(A, n, G[i]) insertionSort A n G[i] G i print(m) print m print(*G) print *G G print(cnt) print cnt print(*A, sep='\n') print *A A sep='\n' sep '\n' cnt = 0 0 cnt def insertionSort(A, n, g):
    global cnt
    for i in range(g, n):
        v = A[i]
        j = i - g
        while j >= 0 and A[j] > v:
            A[j+g] = A[j]
            j = j - g
            cnt += 1
        A[j+g] = v def insertionSort(A, n, g):
    global cnt
    for i in range(g, n):
        v = A[i]
        j = i - g
        while j >= 0 and A[j] > v:
            A[j+g] = A[j]
            j = j - g
            cnt += 1
        A[j+g] = v insertionSort G = [int(pow(4, i) + 3*pow(2, i-1) + 1) for i in range(10)[::-1]] + [1] [int(pow(4, i) + 3*pow(2, i-1) + 1) for i in range(10)[::-1]] + [1] G m = len(G) len(G) m G = [v for v in G if v <= n] [v for v in G if v <= n] G n = int(input()) int(input()) n A = [int(input()) for _ in range(n)] [int(input()) for _ in range(n)] A
def insertionSort(A, n, g):
    global cnt
    for i in range(g, n):
        v = A[i]
        j = i - g
        while j >= 0 and A[j] > v:
            A[j+g] = A[j]
            j = j - g
            cnt += 1
        A[j+g] = v

n = int(input())
A = [int(input()) for _ in range(n)]
cnt = 0
G = [int(pow(4, i) + 3*pow(2, i-1) + 1) for i in range(10)[::-1]] + [1]
G = [v for v in G if v <= n]
m = len(G)
for i in range(m):
    insertionSort(A, n, G[i])
print(m)
print(*G)
print(cnt)
print(*A, sep='\n')