101742: [AtCoder]ABC174 C - Repsept

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Score : $300$ points

Problem Statement

Takahashi loves the number $7$ and multiples of $K$.

Where is the first occurrence of a multiple of $K$ in the sequence $7,77,777,\ldots$? (Also see Output and Sample Input/Output below.)

If the sequence contains no multiples of $K$, print -1 instead.

Constraints

  • $1 \leq K \leq 10^6$
  • $K$ is an integer.

Input

Input is given from Standard Input in the following format:

$K$

Output

Print an integer representing the position of the first occurrence of a multiple of $K$. (For example, if the first occurrence is the fourth element of the sequence, print 4.)


Sample Input 1

101

Sample Output 1

4

None of $7$, $77$, and $777$ is a multiple of $101$, but $7777$ is.


Sample Input 2

2

Sample Output 2

-1

All elements in the sequence are odd numbers; there are no multiples of $2$.


Sample Input 3

999983

Sample Output 3

999982

Input

题意翻译

有一个数列 $a$ 满足以下性质: $$a_i = \begin{cases} 7 & x = 1 \\ a_{i-1} \times 10 + 7 & x \geq 2\end{cases}$$ 现给出一个数 $k$,请求出一个最小的 $i$,使得 $a_i \equiv 0 \pmod k$。无解时请输出 $-1$。 $1 \leq k \leq 10^6$。

加入题单

算法标签: