Problem: 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.

Input

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

Output

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

Examples

Input

a


Output

51


Input

hi


Output

76

Note

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

Solution (in JAVA):

Solution:


import java.io.*;
import java.text.SimpleDateFormat;
import java.util.*;


public class Main {


    String name;

    public Main(String name) {
        this.name = name;
    }




    static Scanner scanner = new Scanner(System.in);
    static PrintWriter out = new PrintWriter(System.out);



    static int solve(int n) {

        int [] a = {500,200,100,50,20,10};

        int num = 0;
        int k;

        boolean flag = false;

        while (n>0) {

            for (int i = 0; i < a.length; i++) {


                k = n / a[i];

                if (k > 0) {
                    n -= k*a[i];

                }
                else {

                    continue;
                }

                if(n%a[a.length-1]!=0) {
                    flag=true;
                    break;
                }

                num+=k;
            }

            if (flag) {
                break;
            }

        }

        if (flag) {
            return -1;
        }

        else {

            return num;
        }


    }

    public static int findIt(int[] a) {

        int num = 0;
        int c = 0;

        HashSet<Integer> set = new HashSet<>();


        for (int i = 0; i < a.length; i++) {
             set.add(a[i]);
        }

        Iterator<Integer> it = set.iterator();

        while (it.hasNext()) {

            int b = it.next();

            for (int i = 0; i < a.length; i++) {
                if (b == a[i]) {
                    num++;
                }
            }
            if(num%2!=0) {
                c=b;
                break;
            }

            num=0;
        }


        return c;
    }


    public static String makeReadable(int seconds) {

        int hours = seconds / 3600;

        seconds = seconds - hours * 3600;

        int minutes = seconds / 60;

        int second = (seconds - minutes * 60);


        return String.format("%02d:%02d:%02d",hours,minutes,second);
    }

    public static void main(String[] args) {

        String str = scanner.next();
        int length = str.length();
        int num = 0-length;

        for (int i = 1; i <= length + 1; i++) {
                num+=26;
        }

        System.out.println(num);
    }


     
     static int gcd(int a, int b)
    {
        return (b == 0) ? a : gcd(b, a%b);
    }

    static int nok(int a, int b)
    {
        return a*b/gcd(a, b);
    }

    static int max(int [] a,int i) {

        int maxx = Integer.MIN_VALUE;

        for (int j = i + 1; j < a.length; j++) {

            if (a[j] > maxx) {

                maxx = a[j];

            }

        }



        return maxx;
    }


}