{-# OPTIONS_GHC -O2 -funbox-strict-fields #-}
{-# OPTIONS_GHC -fno-warn-unused-imports #-}
{-# OPTIONS_GHC -fno-warn-missing-signatures #-}
{-# OPTIONS_GHC -fno-warn-unused-binds #-}
{-# OPTIONS_GHC -fno-warn-incomplete-patterns #-}
{-# OPTIONS_GHC -fno-warn-name-shadowing #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE FlexibleContexts #-}
-- {-# LANGUAGE MultiWayIf #-}
-- {-# LANGUAGE BangPatterns #-}
-- {-# LANGUAGE ViewPatterns #-}
-- {-# LANGUAGE TupleSections #-}

import           System.IO hiding (char8)
import           Control.Applicative
import           Control.Monad
import           Data.List
import           Data.Tuple
import           Data.Int
import           Data.Char
import           Data.Function (on)
import           Data.Ord (comparing)
import           Data.Monoid (mappend)
-- import           Data.Array
import           Data.Array.Unboxed
import           Data.Array.IArray
import           Data.Array.ST
import           Data.Array.MArray
-- import           Data.Array.Unsafe
import           Data.Ix
import           Data.Maybe
-- import           Data.Monoid hiding ((<>))
import qualified Data.ByteString.Char8 as BS
import qualified Data.ByteString.Lazy.Char8 as BL
import           Data.ByteString.Builder
-- import           Data.Graph
-- import           Data.Vector.Unboxed ((//), (++), (!), (!?))
-- import qualified Data.Vector.Unboxed as U
-- import           Data.IntSet (IntSet)
-- import qualified Data.IntSet as IntSet
-- import           Data.IntMap.Strict (IntMap)
-- import qualified Data.IntMap.Strict as IntMap
-- import           Data.Sequence ((|>), (<|), (><),ViewR(..), ViewL(..), Seq)
-- import qualified Data.Sequence              as Seq
-- import           Data.Foldable (toList, minimumBy)
-- import           Debug.Trace
import Data.Array.Base(unsafeRead, unsafeWrite)
import Data.Array.IO

main :: IO ()
main = do
  n <- readInt1 <$> BS.getLine
  ns <- map readInt1 <$> replicateM n BS.getLine
  arr <- newListArray (0, n) (0:ns) :: IO (IOUArray Int Int)
  let intervals = genIntervals n
  print $ length intervals
  putIntN intervals
  shellSort arr intervals
  es <- getElems arr
  mapM_ print es

genIntervals :: Int -> [Int]
-- genIntervals n = reverse . takeWhile (< n) $ iterate (\x -> 2 * x) 1
genIntervals n = reverse . takeWhile (<= n) $ iterate (\x -> 3 * x + 1) 1

-- use array[0] for store "cnt"

shellSort :: (MArray a Int m) => a Int Int -> [Int] -> m ()
shellSort arr intervals = forM_ intervals $ \interval ->
  forM_ [1..interval] $ insertionSort arr interval

insertionSort :: (MArray a Int m) => a Int Int -> Int -> Int -> m ()
insertionSort arr interval offset = do
  (_,n) <- getBounds arr
  let startlines = takeWhile (<=n) $ map ((+offset).(*interval)) [0..]
  forM_ startlines $ insertion arr interval
  t <- unsafeRead arr interval
  unsafeWrite arr interval t

insertion :: (MArray a Int m) => a Int Int -> Int -> Int -> m ()
insertion arr interval r = do
  let l = r - interval
  when (l > 0) $ do
    x <- unsafeRead arr l
    y <- unsafeRead arr r
    when (x > y) $ do
      increment arr
      swapArray arr l r
      insertion arr interval l

swapArray :: (MArray a Int m) => a Int Int -> Int -> Int -> m ()
swapArray arr i j = do
  x <- unsafeRead arr i
  y <- unsafeRead arr j
  unsafeWrite arr i y
  unsafeWrite arr j x

increment :: (MArray a Int m) => a Int Int -> m ()
increment arr = do
  x <- unsafeRead arr 0
  unsafeWrite arr 0 $ x+1

--  --  --  --  --  --  --  --  --  --  --  --  --  --  --  --  --  --  --  --

format :: Show a => Maybe a -> IO ()
format Nothing = putStrLn "NO"
format (Just a) = putStrLn "YES" >> print a

-- [1,2,3] -> 1 2 3
putIntN :: [Int] -> IO ()
putIntN [] = return ()
putIntN xs = BL.putStrLn . toLazyByteString . foldl1 mappend . intersperse (char8 ' ') $ map intDec xs

readInt1 :: BS.ByteString -> Int
readInt1 = fst . fromJust . BS.readInt

readInt2 :: BS.ByteString -> (Int,Int)
readInt2 = toTuple . readIntN

readInt3 :: BS.ByteString -> (Int,Int,Int)
readInt3 = toTriple . readIntN

readIntN :: BS.ByteString -> [Int]
readIntN =  map readInt1 . BS.words

readInt641 :: BS.ByteString -> Int64
readInt641 = fromIntegral . fst . fromJust . BS.readInteger

readInt642 :: BS.ByteString -> (Int64,Int64)
readInt642 = toTuple . readInt64N

readInt643 :: BS.ByteString -> (Int64,Int64,Int64)
readInt643 = toTriple . readInt64N

readInt64N :: BS.ByteString -> [Int64]
readInt64N =  map readInt641 . BS.words

readInteger1 :: BS.ByteString -> Integer
readInteger1 = fst . fromJust . BS.readInteger

readInteger2 :: BS.ByteString -> (Integer,Integer)
readInteger2 = toTuple . readIntegerN

readInteger3 :: BS.ByteString -> (Integer,Integer,Integer)
readInteger3 = toTriple . readIntegerN

readIntegerN :: BS.ByteString -> [Integer]
readIntegerN =  map readInteger1 . BS.words

toTuple :: [a] -> (a, a)
toTuple [x, y] = (x, y)

toTriple :: [a] -> (a, a, a)
toTriple [x, y, z] =(x, y, z)

fromTuple :: (a, a) -> [a]
fromTuple (x, y) = [x, y]

fromTriple :: (a, a, a) -> [a]
fromTriple (x, y, z) = [x, y, z]

-- if not applying, use "const"

applyTuple :: (a -> a') -> (b -> b') -> (a, b) -> (a', b')
applyTuple f g (x, y) = (f x, g y)

applyTriple :: (a -> a') -> (b -> b') -> (c -> c') -> (a, b, c) -> (a', b', c')
applyTriple f g h (x, y, z) = (f x, g y, h z)

-- @since 4.8.0.0
sortOn' :: Ord b => (a -> b) -> [a] -> [a]
sortOn' f =
  map snd . sortBy (comparing fst) . map (\x -> let y = f x in y `seq` (y, x))

Measured memory_bytes: 206884