ACM.Ones

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

Output for Sample Input

3

6

12

code

#include <iostream>

using namespace std;

int main()
{
    int n,temp;
    int a=1,bits=1;
    while(cin>>n)
    {
        a=1;bits=1;
        while(1)
        {
            temp=a%n;
            if(temp==0)
                {
                    cout<<bits<<endl;
                    break;
                }
            else
            {
                a=temp*10+1;
                bits++;
            }
        }
    }
    return 0;
}