#include <bits/stdc++.h>
int f[50];
int main() {
  int n, cnt = 0, s[5] = {};
  scanf("%d", &n);
  f[0] = 0;
  f[1] = f[2] = 1;
  for (int i = 3; i < 45; i++) f[i] = f[i - 1] + f[i - 2];
  for (int i = 44; i > 0;) {
    if (f[i] <= n) {
      n -= f[i];
      s[cnt] = f[i];
      cnt++;
      if (cnt > 2) break;
    } else
      i--;
  }
  if (n != 0)
    puts("I'm too stupid to solve this problem");
  else
    for (int i = 0; i < 3; i++) printf("%d%c", s[2 - i], i == 2 ? '\n' : ' ');
  return 0;
}
