Isomorphic Strings Challenge

Given two strings, determine whether they are isomorphic. Two strings are isomorphic if there exists a one-to-one mapping between every character of the first string to every character of the second string while preserving the order. Formally, for two strings \( s_1 \) and \( s_2 \), they are isomorphic if there exists a bijection \( f: s_1 \to s_2 \) such that for every character \( c \) in \( s_1 \), replacing \( c \) with \( f(c) \) yields \( s_2 \).

Note: Two empty strings are considered isomorphic.

inputFormat

The input consists of two lines:

• The first line contains the first string \( s_1 \).
• The second line contains the second string \( s_2 \).

Both strings consist of printable characters.

outputFormat

Output a single line with either True or False (without quotes) indicating whether the two strings are isomorphic.

## sample

paper
title

True

</p>