while (k > 1 && Perm[k] < Perm[k - 1])
while (Perm[j] < Perm[k - 1])
for (int l = 0; l <= (n - k) / 2; l++)
Perm[k + 1] = Perm[n - 1];
public static void Main()
n = int.Parse(Console.ReadLine());
Array.Resize(ref Perm, n + 1);
for (int i = 1; i <= n; i++)