#include <bits/stdc++.h>
using namespace std;
const long long nax = 1e5;
inline void solve() {
  long long n;
  cin >> n;
  if (n == 0) {
    cout << 0 << ' ' << 0 << ' ' << 0;
    return;
  }
  if (n == 1) {
    cout << 0 << ' ' << 0 << ' ' << 1;
    return;
  }
  if (n == 2) {
    cout << 0 << ' ' << 1 << ' ' << 1;
    return;
  }
  if (n == 3) {
    cout << 1 << ' ' << 1 << ' ' << 1;
    return;
  }
  long long f[nax];
  f[0] = 0;
  f[1] = 1;
  for (long long i = 2; i < nax; i++) f[i] = f[i - 1] + f[i - 2];
  for (long long i = 0; i < nax; i++) {
    if (f[i] == n) {
      cout << f[i - 4] << ' ' << f[i - 3] << ' ' << f[i - 1];
      return;
    }
  }
  return;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  solve();
  return 0;
}
