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.util.*;

public class A {

    static BufferedReader in;
    static PrintWriter out;
    static StringTokenizer tok;

    public static void main(String[] args) throws IOException {
        try {
            in = new BufferedReader(new FileReader("hull1.in"));
            out = new PrintWriter(new File("hull1.out"));
        } catch (Exception e) {
            in = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(new OutputStreamWriter(System.out));
        }

        tok = new StringTokenizer("");
        new A().solve();
        out.flush();
        out.close();
    }

    String nextTok() throws IOException {
        if (!tok.hasMoreTokens()) {
            tok = new StringTokenizer(in.readLine());
        }
        return tok.nextToken();
    }

    int nextInt() throws IOException {
        return Integer.parseInt(nextTok());
    }

    long nextLong() throws IOException {
        return Long.parseLong(nextTok());
    }

    double nextDouble() throws IOException {
        return Double.parseDouble(nextTok());
    }

    static class Pair implements Comparable<Pair> {

        long a;
        long b;

        public Pair( long a, long b) {

            this.a = a;
            this.b = b;
        }

        @Override
        public int compareTo(Pair o) {
            if (o.a < a) return 1;
            if (o.a > a) return -1;
            if (o.b > b) return -1;
            if (o.b < b) return 1;
            return 0;
        }
    }

    void solve() throws IOException {
        String str = nextTok();
        
        TreeSet<String> ts = new TreeSet<String>();
        for (int i = 0; i <= str.length(); i++) {
            for (char j = 'a'; j <= 'z'; j++) {
                //System.out.println(str.substring(0,i)+String.valueOf(j)+str.substring(i,str.length()));
                ts.add(str.substring(0,i)+String.valueOf(j)+str.substring(i,str.length()));
                
            }
        }
        System.out.println(ts.size());
    }

}