#include<bits/stdc++.h> using namespace std; bool huiwen(char c[]){ for(int i=1;i<strlen(c);i++){ if(c[i]!=c[strlen(c)-1-i]) return 0; } return 1; } int main() { int n,step=0; char a[101],b[110]; cin>>n>a; int len=strlen(a); while(huiwen(b)==0){ int x=0; for(int i=0;i<len;i++){ b[i]=(a[i]-'0'+a[len-1-i]-'0'+x)%n; x=(a[i]-'0'+a[len-1-i]-'0')/n; } if(x>0) b[len++]=x; } for(int i=0;i<len;i++){ a[i]=b[i]+'0'; } step++; cout<<endl; if(step<=30) cout<<"step="<<step; else cout<<"Impossible!"; return 0; }