#include <bits/stdc++.h>
using namespace std;
const long long N = 200100, mod = 1e9 + 7, mod2 = 1e9 + 9, mod3 = 998244353,
                sq = 450;
long long n, m, k, x, y, z, w, t, ans, q, a[N];
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n;
  a[1] = 1;
  for (int i = 2; i < N; i++) {
    a[i] = a[i - 1] + a[i - 2];
    if (a[i] > 1e9) {
      m = i;
      break;
    }
  }
  for (int i = 0; i < m; i++) {
    for (int j = 0; j < m; j++) {
      for (int o = 0; o < m; o++) {
        if (a[i] + a[j] + a[o] == n)
          return cout << a[i] << ' ' << a[j] << ' ' << a[o], 0;
      }
    }
  }
  cout << "I'm too stupid to solve this problem";
  return 0;
}
