#include <bits/stdc++.h>
int f[1000];
int Fibonacci() {
  f[0] = 0, f[1] = 1;
  for (int i = 2; i < 1000; i++) f[i] = f[i - 1] + f[i - 2];
  return 0;
}
int main() {
  int n, i;
  Fibonacci();
  while (scanf("%d", &n) != EOF) {
    int j, k, t;
    for (i = 0;; i++)
      if (n == f[i]) {
        t = i;
        break;
      }
    switch (n) {
      case 0:
        printf("0 0 0\n");
        break;
      case 1:
        printf("0 0 1\n");
        break;
      case 2:
        printf("0 1 1\n");
        break;
      default:
        printf("%d %d %d\n", f[t - 4], f[t - 3], f[t - 1]);
    }
  }
  return 0;
}
