Divisibility Checker

Given an integer \( k \) and a number \( N \) represented as a string, determine whether \( N \) is divisible by \( k \). The number \( N \) can be very large and is provided as a string to avoid integer overflow issues. You need to simulate the division process without converting \( N \) directly into a numerical type in languages that may not support arbitrarily large integers.

Input Example: For \( k=7 \) and \( N="49" \), the program should output True because \( 49 \) is divisible by \( 7 \). Likewise, for \( k=11 \) and \( N="123456789" \), the output should be False.

inputFormat

The input consists of two tokens separated by whitespace: the first token is an integer \( k \) representing the divisor, and the second token is a string \( N \) representing a non-negative number.

Input is provided via standard input (stdin).

outputFormat

Output a single line with either True or False (without quotes) depending on whether \( N \) is divisible by \( k \) or not. Output should be written to standard output (stdout).

11
123456789

False