#include <fstream>
#include <algorithm>

using namespace std;

int N[10000];
char aux[1005];

int main()
{
    ifstream fin("sarpe.in");
    ofstream fout("sarpe.out");

    fin.getline(aux, 1005);
    for (int i = 0; aux[i] != '\0'; ++i, ++N[0])
        N[i + 1] = aux[i] - '0';
    reverse(N + 1, N + N[0]+ 1);

    --N[1];
    for (int i = 1; N[i] < 0; ++i)
    {
        N[i] += 10;
        --N[i + 1];
    }
    while (N[N[0]] == 0) --N[0];

    for (int i = 1; i <= N[0]; ++i)
        N[i] *= 8;
    for (int i = 1; i <= N[0]; ++i)
        if (N[i] >= 10)
        {
            N[i + 1] += N[i] / 10;
            N[i] %= 10;
            N[0] = max(N[0], i + 1);
        }

    for (int i = N[0]; i >= 1; --i)
        fout << N[i];

    fin.close();
    fout.close();
}