#atcoderABC057C. Digits in Multiplication

Digits in Multiplication

Problem Statement

You are given an integer NN.
For two positive integers AA and BB, we will define F(A,B)F(A,B) as the larger of the following: the number of digits in the decimal notation of AA, and the number of digits in the decimal notation of BB.
For example, F(3,11)=2F(3,11) = 2 since 33 has one digit and 1111 has two digits.
Find the minimum value of F(A,B)F(A,B) as (A,B)(A,B) ranges over all pairs of positive integers such that N=A×BN = A \times B.

Constraints

  • 1N10101 \leq N \leq 10^{10}
  • NN is an integer.

Input

The input is given from Standard Input in the following format:

NN

Output

Print the minimum value of F(A,B)F(A,B) as (A,B)(A,B) ranges over all pairs of positive integers such that N=A×BN = A \times B.

Input 1

10000

Output 1

3

F(A,B)F(A,B) has a minimum value of 33 at (A,B)=(100,100)(A,B)=(100,100).

Input 2

1000003

Output 2

7

There are two pairs (A,B)(A,B) that satisfy the condition: (1,1000003)(1,1000003) and (1000003,1)(1000003,1). For these pairs, F(1,1000003)=F(1000003,1)=7F(1,1000003)=F(1000003,1)=7.

Input 3

9876543210

Output 3

6