#include <bits/stdc++.h>
long long mod;
using namespace std;
int lim = 0;
long long pw(long long x, long long n) {
  long long res = 1;
  while (n) {
    if (n & 1) res = res * x * 1ll % mod;
    x = x * x * 1ll % mod;
    n /= 2;
  }
  return res;
}
int main() {
  int n;
  cin >> n;
  if (n == 0)
    printf("0 0 0");
  else if (n == 1)
    printf("0 0 1");
  else {
    int x[4];
    x[0] = 0;
    x[1] = 1;
    x[2] = x[0] + x[1];
    while (x[2] != n) {
      x[0] = x[1];
      x[1] = x[2];
      x[2] = x[0] + x[1];
    }
    printf("0 %d %d", x[0], x[1]);
  }
}
