A. Little C Loves 3 I

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/jj12345jj198999/article/details/82902814

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能被3整除，肯定可以拆开为 1 1 n-2的模式，否则就为 1 2 n-3.

#include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;

int main() 
{
	int num;
	scanf("%d", &num);
	if (num % 3 == 0)
	{
		printf("1 1 %d\n", num - 2);
	}
	else
	{
		printf("1 2 %d\n", num - 3);
	}
	return 0;
}