#include <bits/stdc++.h>
using namespace std;
const long long int N = (1e6);
const long long int mod = (1e9 + 7);
int main() {
  int n;
  cin >> n;
  long long int fib[100001];
  fib[0] = 0;
  fib[1] = 1;
  if (n == 1) {
    return cout << 0 << " " << 0 << " " << 1, 0;
  }
  if (n == 0) {
    return cout << 0 << " " << 0 << " " << 0, 0;
  }
  for (int i = 2; i < 100001; ++i) {
    fib[i] = fib[i - 1] + fib[i - 2];
  }
  for (int i = 0; i < 100001; ++i) {
    if (fib[i + 2] == n) cout << fib[i - 1] << " " << fib[i] << " " << fib[i];
  }
}
