#include <bits/stdc++.h>   using namespace std;   vector<int> fibton;   void Fib(int n) {     int x = 0, y = 1, z = 0;     fibton.push_back(0);     for (int i = 0; i <= n; i++) {       z = x + y;       fibton.push_back(z);       if (fibton[fibton.size() - 1] >= n) {         break;       }       x = y;       y = z;     }   }   int main() {     int n;     cin >> n;     Fib(n);     for (int i = 0; i < fibton.size(); i++) {       for (int j = i; j < fibton.size(); j++) {         for (int k = j; k < fibton.size(); k++) {           if ((fibton[i] + fibton[j] + fibton[k]) == n) {             cout << fibton[i] <<     << fibton[j] <<     << fibton[k];             return 0;           }         }       }     }     return 0;   }   