Algorithms and Data Structures

AND of Binary Strings

You are given two binary strings and . Both strings may be quite long, containing up to 1000 bits. Your task is to compute the bitwise AND of these two binary strings and output the result.

Input

The first line contains the first binary string (). The second line contains the second binary string ().

Output

Output a single binary string: the bitwise AND of and .

Examples

Input
Output
1101 1010
1000
111 000
000

Constraints

Time limit: 2 seconds

Memory limit: 512 MB

Output limit: 1 MB

To check your solution you need to sign in
Sign in to continue