1047A Little C Loves 3 I

版权声明：大家一起学习，欢迎转载，转载请注明出处。若有问题，欢迎纠正！ https://blog.csdn.net/memory_qianxiao/article/details/82830209

A. Little C Loves 3 I

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Little C loves number «3» very much. He loves all things about it.

Now he has a positive integer nn. He wants to split nn into 33 positive integers a,b,ca,b,c, such that a+b+c=na+b+c=n and none of the 33 integers is a multiple of 33. Help him to find a solution.

Input

A single line containing one integer nn (3≤n≤1093≤n≤109) — the integer Little C has.

Output

Print 33 positive integers a,b,ca,b,c in a single line, such that a+b+c=na+b+c=n and none of them is a multiple of 33.

It can be proved that there is at least one solution. If there are multiple solutions, print any of them.

Examples

input

Copy

3

output

Copy

1 1 1

input

Copy

233

output

Copy

77 77 79

题意：给你一个n，把n分解成三个数都不是3的倍数的数。

题解：数论  总共三种情况，余0，1，2的情况。分类处理。

c++：

#include<bits/stdc++.h>
using namespace std;
int main()
{
   int n;
   cin>>n;
   if(n%3==2) printf("2 2 %d\n",n-4);
    else printf("1 1 %d\n",n-2);
    return 0;
}

python：

n=int(input())
if n%3==2:print("2 2 %d"%(n-4))
else:print("1 1 %d"%(n-2))