题目链接:http://acm.uestc.edu.cn/#/problem/show/1272
思路:暴力发现规律
ac代码:
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<iostream>
#include<algorithm>
#define MAXN 1010000
#define LL long long
#define ll __int64
#define INF 0x7fffffff
#define mem(x) memset(x,0,sizeof(x))
#define PI acos(-1)
#define mod 1000000007
using namespace std;
int main()
{
long n;
while(scanf("%ld",&n)!=EOF)
{
printf(n>=7?"7\n":"-1\n");
}
return 0;
}