Large Number Addition

You are given two non-negative integers represented as strings. Your task is to compute their sum and output the result as a string without any leading zeros (except when the result is zero itself).

The integers may be very large so you cannot simply convert them to built-in numeric types. Instead, you should simulate the addition digit by digit.

Mathematically, if \( num1 \) and \( num2 \) are the two input numbers, you need to compute: \[ num1 + num2 = result \] where the result is also represented as a string with no redundant leading zeros.

Input is taken from standard input (stdin) and output should be printed to standard output (stdout).

inputFormat

The input consists of two lines. The first line contains the first non-negative integer as a string. The second line contains the second non-negative integer as a string. Note that the strings may contain leading zeros or even be empty (which should be interpreted as 0).

outputFormat

Output a single line containing the sum of the two integers, represented as a string without leading zeros. If the sum is 0, output "0".

123456789123456789
987654321987654321

1111111111111111110