PROGRAMMING:String encryption
Find the length of a string, and encrypt and transform the string as follows:
A->Z a->z
B->Y b->y
C->X c->x
…… ……
Z->A z->a
That is, the letter a becomes Z, the letter B becomes y,..., and the non alphabetic characters remain unchanged.
###Input format:
Read in a line of characters from the keyboard (Convention: number of characters ≤ 127 bytes)
###Output format:
The length of this line of characters is displayed on the screen first, and then the generated ciphertext is displayed.
###Input example:
```in
AB 12@#ax
```
###Output example:
The corresponding output is given here. For example:
```out
nine
ZY 12@#zc
```
answer:If there is no answer, please comment
A->Z a->z
B->Y b->y
C->X c->x
…… ……
Z->A z->a
That is, the letter a becomes Z, the letter B becomes y,..., and the non alphabetic characters remain unchanged.
###Input format:
Read in a line of characters from the keyboard (Convention: number of characters ≤ 127 bytes)
###Output format:
The length of this line of characters is displayed on the screen first, and then the generated ciphertext is displayed.
###Input example:
```in
AB 12@#ax
```
###Output example:
The corresponding output is given here. For example:
```out
nine
ZY 12@#zc
```
answer:If there is no answer, please comment