1. You are given a string that contains only lowercase and uppercase alphabets. 2. You have to form a string that contains the difference of ASCII values of every two consecutive characters between those characters. For "abecd", the answer should be "a1b3e-2c1d", as 'b'-'a' = 1 'e'-'b' = 3 'c'-'e' = -2 'd'-'c' = 1
Input Format
A String
Output Format
A String
Constraints
1 <= length of string <= 1000
Example
Input
pepCODinG
Output
p-11e11p-45C12O-11D37i5n-39G