#include <bits/stdc++.h>
int f[1000001];
int main() {
  int n;
  scanf("%d", &n);
  f[0] = 0;
  f[1] = 1;
  f[2] = 1;
  int i, j, k;
  for (i = 3;; i++) {
    f[i] = f[i - 1] + f[i - 2];
    if (f[i] > 1000000000) break;
  }
  int idx = i;
  int no = 0;
  for (i = 0; i < idx; i++) {
    for (j = i; j < idx; j++) {
      for (k = i; k < idx; k++) {
        if ((long long)f[i] + (long long)f[j] + (long long)f[k] == n) {
          no = 1;
          printf("%d %d %d\n", f[i], f[j], f[k]);
          break;
        }
      }
      if (no) break;
    }
    if (no) break;
  }
  if (no == 0) printf("I'm too stupid to solve this problem\n");
  scanf(" ");
}
