CodeForces 246A Buggy Sorting-CSDN博客

本文链接：https://blog.csdn.net/yao1373446012/article/details/53493695

本文介绍了一种名为BuggySorting的排序算法，并探讨了该算法可能存在的错误。通过构造特定的数据集来验证算法的正确性，若算法无法按非递减排列，则提供反例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Buggy Sorting

Little boy Valera studies an algorithm of sorting an integer array. After studying the theory, he went on to the practical tasks. As a result, he wrote a program that sorts an array of n integers a₁, a₂, ..., a_n in the non-decreasing order. The pseudocode of the program, written by Valera, is given below. The input of the program gets number n and array a.

loop integer variable i from 1 to n - 1
    loop integer variable j from i to n - 1
        if (a_j > a_j + 1), then swap the values of elements a_j and a_j + 1

But Valera could have made a mistake, because he hasn't yet fully learned the sorting algorithm. If Valera made a mistake in his program, you need to give a counter-example that makes his program work improperly (that is, the example that makes the program sort the array not in the non-decreasing order). If such example for the given value of n doesn't exist, print -1.

Input

You've got a single integer n (1 ≤ n ≤ 50) — the size of the sorted array.

Output

Print n space-separated integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 100) — the counter-example, for which Valera's algorithm won't work correctly. If the counter-example that meets the described conditions is impossible to give, print -1.

If there are several counter-examples, consisting of n numbers, you are allowed to print any of them.

Example

Input

Output

-1

题意：给出一种排序方式，问能不能使一组数据，排序后成为非递减序列，给出数据个数，如果不行，输出判断数据。

水题，模拟一遍即可

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
	int n,i,j;
	while(scanf("%d",&n)!=EOF)
	{
		if(n==1||n==2)
		{
			printf("-1\n");
		}
		else
		{
			for(i=n;i>1;i--)
			    printf("%d ",i);
			printf("1\n");
		}
	}
	return 0;
 }