HOJ 1006

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
inline int read(){
	int x=0,f=1,ch=getchar();
	while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1;ch=getchar();}
	while(ch>=‘0‘&&ch<=‘9‘){x=x*10+ch-‘0‘;ch=getchar();}
	return x;
}
bool vis[60];
inline int cal(int x,int y){
	if(x==0) return 0;
	if(vis[x]) return -1;
	vis[x]=1;
	x*=y;x%=60;
	if(x==0) return 1;
	int res=cal(x,y);
	if(res==-1) return -1;
	return res+1;
}
int main(){
	int n=read(),m=read();
	// cout<<n<<"\t"<<m<<endl;
	while(n!=0||m!=0){
		memset(vis,0,sizeof(vis));
		int ans=cal(n,m+1);
		if(ans==-1) puts("Impossible");
		else printf("%d\n",ans);
		n=read();m=read();
	}
	return 0;
}