Task
Time limit: 1000 ms,
Memory limit: 256 Mb

If the integer m is divisible entirely by the integer n, then output the quotient of the integer division of m by n, otherwise output the message "not completely divisible".

Input: two integers (m and n) are fed to the input, on one line (n> 0)
Output data: according to the condition of the problem