A. Little C Loves 3 I（水题）

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

3

output

1 1 1

input

233

output

77 77 79

 题意：先输入一个整数n，然后把n分成三个整数a,b,c；要求a+b+c=n;并且a,b,c都不能被三整除。

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

int main()
{
	long long n,sum,cpy1,cpy2;
	bool pd=false;
	cin>>n;
	for(long long i=1;i<n;i++)
	{
		for(long long j=1;j<n;j++)
		{
			if(((n-i-j)%3)!=0&&(i%3)!=0&&(j%3)!=0)//判断能不能被三整除。 
			{
					cout<<i<<" "<<j<<" "<<(n-i-j);//都不能输出结果 
					pd=true;
					break;
			}
		}
		
		if(pd)
		break;
	}	
	return 0;	
}