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

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

Input

A single line containing one integer n (3 ≤ n ≤ 10^9) — the integer Little C has.

Output

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

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
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int arr[N];
int main() {
  int n;
  scanf("%d", &n);
  ;
  if (n % 3 == 0 || n % 3 == 1) {
    cout << "1 1 " << n - 2;
  } else {
    cout << "1 2 " << n - 3;
  }
  return 0;
}
long long power(long long a, long long b) {
  long long r = 1;
  while (b) {
    if (b & 01) r = (r * a) % 1000000007;
    a = (a * a) % 1000000007;
    b >>= 1;
  }
  return r;
}
int gcd(int a, int b) {
  int c;
  while (a != 0) {
    c = a;
    a = b % a;
    b = c;
  }
  return b;
}
