/*
Ones
--------------------------------------------------------------------------------
Time limit: 1 Seconds Memory limit: 32768K
Total Submit: 114 Accepted Submit: 72
--------------------------------------------------------------------------------
Given any integer 0 <= n <= 10000 not divisible by 2 or 5, some multiple of n is a number which in decimal notation is a sequence of 1's. How many digits are in the smallest such a multiple of n?
Sample Input
3
7
9901
Sample Output
3
6
12
*/
#include<iostream.h>
int n,a,i;
int main(){
while(cin>>n){
a=0;i=1;
while( i++ ) {
a=(1+a*10)%n;
if(a==0) break;
}
cout<<i-1<<endl;
}
return 0;
}