#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;


bool isPalindromes(int n,int t) 
{
    int temp = n;
    int k = 0;

    while (temp != 0) 
    {
        int remainder = temp % t;
        k = k * t + remainder;
        temp /= t;
    }
    return (k == n);
}
//倒过来
int change(int n,int t)

{
    int temp = n;
    int k = 0;

    while (temp != 0)
    {
        int remainder = temp % t;
        k = k * t + remainder;
        temp /= t;
    }
    return k;
}

int main()
{
    int n, t;
    int i = 0;
    cin >> n >> t;
    while (!isPalindromes(t,n))
    {
        int b = change(t, n);
        if (!isPalindromes(n+t,n))
        {
            i++;
            t = b + t;
            if (i > 30)
            {
                break;
            }
        }
        else
        {
            break;
        }

    }
    if (i >= 30)
    {
        cout << "Impossible!" << endl;
    }
    else
    {
        cout << "STEP=" << i << endl;
    }

    return 0;
}