Two strings are "Caesar equivalent" if the distance (counting up) between the corresponding characters are the same. Yes, I made this term up. Here's an example:
"Abc" and "Cde" are equivalent because
distance from a-c == 2 distance from b-d == 2 distance from c-e == 2
The capitalization doesn't make any difference.
"Hello" and "World" are not Caesar equivalent because
distance from h-w == 15 distance from e-o == 10 distance from l-r == 6 distance from l-l == 0 distance from o-d == 15
"Abcd" and "Yzab" are Caesar equivalent because
distance from a-y = 24 distance from b-z = 24 distance from c-a = 24 (it wraps around) distance from d-b = 24
You must write a full program that takes two strings from STDIN, and prints a truthy value if they are Caesar equivalent, and a falsy value if they are not.
Since capitalization doesn't matter, it is acceptable if your program requires the input to be all lower-case, all upper-case, or whatever mix you want, as long as this is specified in your answer.
The input will not have spaces or punctuation.
The inputs will be the same length.