CF554A.Kyoya and Photobooks

Kyoya Ootori is selling photobooks of the Ouran High School Host Club. He has 26 photos, labeled "a" to "z", and he has compiled them into a photo booklet with some photos in some order (possibly with some photos being duplicated). A photo booklet can be described as a string of lowercase letters, consisting of the photos in the booklet in order. He now wants to sell some "special edition" photobooks, each with one extra photo inserted anywhere in the book. He wants to make as many distinct photobooks as possible, so he can make more money. He asks Haruhi, how many distinct photobooks can he make by inserting one extra photo into the photobook he already has?

Please help Haruhi solve this problem.

京谷大鸟正在出售《樱兰高校男公关部》的写真集。他共有 26 张照片，分别标记为 “a” 至 “z”，并已将这些照片按某种顺序（允许重复）编排成一本写真集。该写真集可用一个由小写字母组成的字符串来描述，字符串中各字符即表示写真集中照片的排列顺序。现在，他希望推出若干“特别版”写真集，每本特别版写真集是在原有写真集的任意位置插入一张额外的照片所得。他希望制作尽可能多的互不相同的特别版写真集，从而赚取更多收入。他向春日询问：在已有写真集的基础上，通过插入一张额外的照片，最多能制作出多少种互不相同的写真集？

请帮助春日解决这个问题。

The first line of input will be a single string s (1 ≤ |s| ≤ 20). String s consists only of lowercase English letters.

输入的第一行是一个字符串 $s$（$1 \le |s| \le 20$）。字符串 $s$ 仅由小写英文字母组成。

Output a single integer equal to the number of distinct photobooks Kyoya Ootori can make.

输出一个整数，表示京谷大鸟可以制作的不同影集的数量。

In the first case, we can make 'ab','ac',...,'az','ba','ca',...,'za', and 'aa', producing a total of 51 distinct photo booklets.

在第一种情况下，我们可以制作“ab”、“ac”、……、“az”、“ba”、“ca”、……、“za”以及“aa”，共产生 51 种不同的相册。