시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
1 초 128 MB 67 20 18 30.508%

## 문제

Write a program which accepts as input a positive integer and checks, using the algorithm described below, to see whether or not the integer is divisible by 11. This particular test for divisibility by 11 was given in 1897 by Charles L. Dodgson (Lewis Carroll).

Algorithm:

As long as the number being tested has more than two digits, form a new number by:

• deleting the units digit
• subtracting the deleted digit from the shortened number

The remaining number is divisible by 11 if and only if the original number is divisible by 11.

## 입력

As usual, the first number in the input indicates the number of positive integers that follow. Each positive integer has a maximum of 50 digits. You may assume no leading zeroes exist in the positive integers.

## 출력

For each positive integer in the input, the output consists of a series of numbers formed as a digit is deleted and subtracted, followed by a message indicating whether or not the original number is divisible by 11. Outputs for different positive integers are separated by blank lines.

## 예제 입력 1

1
12345678901234567900


## 예제 출력 1

12345678901234567900
1234567890123456790
123456789012345679
12345678901234558
1234567890123447
123456789012337
12345678901226
1234567890116
123456789005
12345678895
1234567884
123456784
12345674
1234563
123453
12342
1232
121
11
The number 12345678901234567900 is divisible by 11.


## 예제 입력 2

1
1234567879


## 예제 출력 2

1234567879
123456778
12345669
1234557
123448
12336
1227
115
6
The number 1234567879 is not divisible by 11.


## 힌트

Leading zeroes are not considered part of the number and should not be printed.