AOJ0233.cpp

#include <bits/stdc++.h>
using namespace std;

using VS = vector<string>;    using LL = long long;
using VI = vector<int>;       using VVI = vector<VI>;
using PII = pair<int, int>;   using PLL = pair<LL, LL>;
using VL = vector<LL>;        using VVL = vector<VL>;

#define ALL(a)  begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)
#define FORR(i, s, e) for (int(i) = (s); (i) > (e); (i)--)
//#pragma GCC optimize ("-O3") 
#ifdef YANG33
#include "mydebug.hpp"
#else
#define DD(x) 
#endif
const int INF = 1e9;                          const LL LINF = 1e16;
const LL MOD = 1000000007;                    const double PI = acos(-1.0);

/* -----  2019/08/17  Problem: AOJ 0233 / Link: https://onlinejudge.u-aizu.ac.jp/challenges/search/volumes/0233  ----- */

string chng(int n, int t) {
	if (n == 0) return "0";
	string ans = "";
	while (n != 0) {
		int d = n / t; int m = n % t;
		if (m < 0) {
			d++;
			m += -t;
		}
		ans += to_string(m);
		n = d;
	}
	reverse(ALL(ans));
	return ans;
}


int main() {
	int N;
	while (cin >> N, N) {
		auto s = chng(N, -10);
		cout << s << "\n";
	}


	return 0;
}