#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long LL_INF = 0x3f3f3f3f3f3f3f3f;
const int xx[4] = {1, -1, 0, 0};
const int yy[4] = {0, 0, 1, -1};
int inline nextin() {
  int t;
  if (scanf("%d", &t) != 1) exit(0);
  return t;
}
int inline in() {
  int x = 0, c;
  for (; (unsigned)((c = getchar()) - '0') >= 10;) {
    if (c == '-') return -in();
    if (!~c) throw ~0;
  }
  do {
    x = (x << 3) + (x << 1) + (c - '0');
  } while ((unsigned)((c = getchar()) - '0') < 10);
  return x;
}
int f[10000005];
int main() {
  cin.sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  if (n == 0) {
    cout << 0 << ' ' << 0 << ' ' << 0 << endl;
    return 0;
  }
  if (n == 1) {
    cout << 0 << ' ' << 0 << ' ' << 1 << endl;
    return 0;
  }
  f[0] = 0;
  f[1] = 1;
  int i;
  for (i = 2;; i++) {
    f[i] = f[i - 1] + f[i - 2];
    if (f[i] == n) break;
  }
  int a = i - 1, b = i - 2, c = i - 3, d = i - 4;
  if (a >= 0 && c >= 0 && d >= 0)
    cout << f[a] << ' ' << f[c] << ' ' << f[d] << endl;
  else if (b >= 0 && c >= 0)
    cout << f[b] << ' ' << f[b] << ' ' << f[c] << endl;
  else
    puts("I'm too stupid to solve this problem");
  return 0;
}
