#include <bits/stdc++.h>
using namespace std;
void conversion(long int n, int m) {
    vector<int> myVec;
    if (n == 0) myVec.push_back(0);
    while (n) {
        myVec.push_back(n % m);
        n /= m;
    }
    reverse(myVec.begin(), myVec.end());
    for (int i = 0; i < myVec.size(); i++) {
        cout << myVec[i];
    }
    cout << endl;
}

int main() {
    int m;
    while (cin >> m) {
        if (m != 0) {
            int a, b;
            cin >> a >> b;
            long int n = a + b;
            conversion(n, m);
        } 
        else {
            break;
        }
    }
    return 0;
}