#include <bits/stdc++.h>
using namespace std;
const int M = 110000;
int f[M];
int main() {
  f[0] = 0;
  f[1] = 1;
  for (int i = 2; i < 45; i++) {
    f[i] = f[i - 1] + f[i - 2];
  }
  int n;
  while (~scanf("%d", &n)) {
    bool flag = false;
    for (int i = 0; i < 45; i++) {
      for (int j = 0; j < 45; j++) {
        for (int k = 0; k < 45; k++) {
          if (f[i] + f[j] + f[k] == n) {
            printf("%d %d %d\n", f[i], f[j], f[k]);
            flag = true;
            break;
          }
        }
        if (flag) break;
      }
      if (flag) break;
    }
    if (!flag) puts("I'm too stupid to solve this problem");
  }
  return 0;
}
