Code Point Distance

Version: Phuoc Hung OJ Extended

Problem Statement

Given Unicode characters $a$ and $b$, let $x$ and $y$ denote their respective Unicode code points. Define their code point distance as the absolute difference between $x$ and $y$.

Compute that distance. It is independent of the input order and equals $0$ for equal code points.

Input

The first line contains exactly one character $a$; the second contains exactly one character $b$.

Output

Print the nonnegative integer $|\operatorname{ord}(a)-\operatorname{ord}(b)|$.

Subtasks

• Subtask 1 (100 points): $a,b$ are printable ASCII characters or characters from ĐắkLắkHàNộiBìnhAnViệtNamΩ€中.

Examples

Example 1

Input

A
C

Output

2

Explanation. A has code point $65$ and C has $67$: $|65-67|=2$.

Example 2

Input

Đ
A

Output

207

Explanation. Đ has code point $272$ and A has $65$: the distance is $207$.

Example 3

Input

0
0

Output

0

Explanation. Both characters are 0, so both have code point $48$ and their distance is $0$.