import Data.List

main :: IO ()
main = do
  n <- read <$> getLine :: IO Int
  let (check,k) = notfind 1 n
  if check then putStrLn $ "No"
    else putStrLn "Yes" >> putStrLn (show k) >> subset 0 (k-1) 0 --

notfind :: Int -> Int -> (Bool,Int)
notfind count n = if 2*n == count*(count+1) then (False,count+1)
  else if 2*n < count*(count+1) then (True,count+1)
     else notfind (count+1) n

subset :: Int -> Int -> Int -> IO ()
subset n k iv = do
  if n == (k+1) then return () else do
    putStr $ (show k) ++ " "
    --putStr "loop1-> "
    loop1 n (k-n) (iv+(n*k-(n*(n-1))`div`2)) --iv+Σ(k-i)
    --putStr "loop2-> "
    loop2 n k iv
    putStrLn ""
    subset (n+1) k iv

loop1 n 0 iv = return ()
loop1 n k iv = do
  putStr $ (show (k+iv)) ++ " "
  loop1 n (k-1) iv

loop2 0 k iv = return ()
loop2 n k iv = do
  putStr $ (show (n+iv)) ++ " "
  loop2 (n-1) (k-1) (iv+k)
