#include <bits/stdc++.h>
using namespace std;
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
const int INF = 1 << 29;
inline int two(int n) { return 1 << n; }
inline int test(int n, int b) { return (n >> b) & 1; }
inline void set_bit(int& n, int b) { n |= two(b); }
inline void unset_bit(int& n, int b) { n &= ~two(b); }
inline int last_bit(int n) { return n & (-n); }
inline int ones(int n) {
  int res = 0;
  while (n && ++res) n -= n & (-n);
  return res;
}
template <class T>
void chmax(T& a, const T& b) {
  a = max(a, b);
}
template <class T>
void chmin(T& a, const T& b) {
  a = min(a, b);
}
int main() {
  long long n;
  long long arr[1000001];
  cin >> n;
  arr[0] = 0;
  arr[1] = 1;
  arr[2] = 1;
  if (n == 0) {
    cout << 0 << " " << 0 << " " << 0 << "\n";
  } else if (n == 1) {
    cout << 1 << " " << 0 << " " << 0 << "\n";
  } else {
    for (int i = (3); i <= (1000001); i++) {
      arr[i] = arr[i - 1] + arr[i - 2];
      if (arr[i] == n) {
        cout << arr[i - 2] << " " << arr[i - 2] << " " << arr[i - 3] << "\n";
        break;
      }
    }
  }
  return 0;
}
