Decrypt the Encrypted Integer

Little Yang has invented a new encryption method. In this method, each lowercase English letter represents a positive integer corresponding to its position in the alphabetical order (i.e., \(a=1, b=2, \ldots, z=26\)). On the other hand, each uppercase English letter represents a negative integer, which is the negative of its ASCII value (i.e., \(A=-65, B=-66, \ldots, Z=-90\)).

Given an encrypted string composed of both uppercase and lowercase letters, your task is to compute the original integer before encryption. The original integer is the sum of the values represented by each letter in the string.

For example, the string "aAc" corresponds to the integer \(1+(-65)+3=-61\).

inputFormat

The input consists of a single line containing a non-empty string composed of uppercase and lowercase English letters.

outputFormat

Output a single integer which is the sum of the numerical values represented by the letters in the string.

sample

aAc

-61