using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Text;

namespace CsharpSpiral {
    partial class Program {
        //https://qiita.com/NotFounds/items/7b166af69a6f52a332de
        static void Main(string[] args) {
            var sw = new StreamWriter( Console.OpenStandardOutput() ) { AutoFlush = false };
            Console.SetOut( sw );
            new Program().Solve( new ConsoleInput( Console.In, ' ' ) );
            Console.Out.Flush();
        }
        struct Card: IComparable<Card> {
            char suit { get; set; }
            int value { get; set; }
            public Card(string info) {
                suit = info[0];
                value = int.Parse( info.Substring( 1 ) );
            }
            public int CompareTo(Card y) => value.CompareTo( y.value );
            public override string ToString() => suit.ToString() + value.ToString();
        }
        public void Solve(ConsoleInput cin) {
            var N = cin.ReadInt;
            var A = new int[N];
            for (int i = 0; i < N; i++)
                A[i] = cin.ReadInt;
            long count = 0;
            var G = new int[100];
            G[0] = 1;
            for (int i = 1; i < 100; i++) {
                G[i] = G[i - 1] * 3 + 1;
            }
            G = G.TakeWhile( g => g <= N ).Reverse().ToArray();
            foreach (var g in G) 
                SkippedInsertionSort( A, N, g, ref count );
            Console.WriteLine(G.Length);
            Console.WriteLine(G.Join());
            Console.WriteLine(count);
            for (int i = 0; i < N; i++) {
                Console.WriteLine(A[i]);
            }
        }

        public void SkippedInsertionSort<T>(T[] A, int N, int g, ref long count) where T:IComparable<T> {
            for (int i = 0; i < N; i++) {
                var tmp = A[i];
                var j = i - g;
                while (j >= 0 && A[j].CompareTo( tmp ) > 0) {
                    A[j + g] = A[j];
                    j -= g;
                    count++;
                }
                A[j + g] = tmp;
            }
        }
    }

    static class ExtendClass {
        public static void Swap<T>(this T[] X, int i, int j) {
            T tmp = X[i];
            X[i] = X[j];
            X[j] = tmp;
        }
        public static string Join<T> (this T[] X, string separator = " ") => string.Join( separator, X);
    }

    class ConsoleInput {
        private readonly TextReader _stream;
        private char _separator = ' ';
        private Queue<string> inputStream;
        public ConsoleInput(TextReader stream, char separator = ' ') {
            this._separator = separator;
            this._stream = stream;
            inputStream = new Queue<string>();
        }
        public string Read {
            get {
                if (inputStream.Count != 0) return inputStream.Dequeue();
                string[] tmp = _stream.ReadLine().Split( _separator );
                for (int i = 0; i < tmp.Length; ++i)
                    inputStream.Enqueue( tmp[i] );
                return inputStream.Dequeue();
            }
        }
        public string ReadLine { get { return _stream.ReadLine(); } }
        public int ReadInt { get { return int.Parse( Read ); } }
        public long ReadLong { get { return long.Parse( Read ); } }
        public double ReadDouble { get { return double.Parse( Read ); } }
        public string[] ReadStrArray(long N) {
            var ret = new string[N];
            for (long i = 0; i < N; ++i)
                ret[i] = Read;
            return ret;
        }
        public int[] ReadIntArray(long N) { var ret = new int[N]; for (long i = 0; i < N; ++i) ret[i] = ReadInt; return ret; }
        public long[] ReadLongArray(long N) { var ret = new long[N]; for (long i = 0; i < N; ++i) ret[i] = ReadLong; return ret; }
    }
}



Measured memory_bytes: 26296