#include <bits/stdc++.h>
using namespace std;
long long f[50];
long long n;
int cnt;
void init() {
  f[0] = 0;
  f[1] = 1;
  int i;
  for (i = 2; f[i] < 50; i++) {
    f[i] += f[i - 1] + f[i - 2];
  }
  cnt = i;
}
int main() {
  init();
  while (cin >> n) {
    int r = cnt;
    int l = 0;
    int m;
    while (l <= r) {
      m = (l + r) >> 1;
      if (f[m] == n) break;
      if (f[m] > n)
        r = m;
      else
        l = m + 1;
    }
    if (n && n != 1)
      cout << f[m - 3] << " " << f[m - 2] << " " << f[m - 2] << endl;
    else if (n == 1)
      printf("0 0 1\n");
    else
      printf("0 0 0\n");
  }
  return 0;
}
