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