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>
int n;
int input() {
  scanf("%d", &n);
  return 0;
}
int main() {
  input();
  int tmp = n / 3, t_remain = tmp % 3, remain = n % 3;
  int a, b, c;
  a = b = c = tmp;
  if (remain == 0) {
    if (t_remain == 0) {
      printf("%d %d %d", a - 1, b - 1, c + 2);
    } else {
      printf("%d %d %d", a, b, c);
    }
  } else if (remain == 1) {
    if (t_remain == 0) {
      printf("%d %d %d", a - 1, b + 1, c + 1);
    } else if (t_remain == 1) {
      printf("%d %d %d", a, b, c + 1);
    } else {
      printf("%d %d %d", a - 1, b - 1, c + 3);
    }
  } else {
    if (t_remain == 0) {
      printf("%d %d %d", a - 1, b + 1, c + 2);
    } else if (t_remain == 1) {
      printf("%d %d %d", a, b + 1, c + 1);
    } else {
      printf("%d %d %d", a, b, c + 2);
    }
  }
  return 0;
}
