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.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashSet;
import java.util.Iterator;
import java.util.LinkedHashSet;
import java.util.LinkedList;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;
public class Main {
	//YOU CAN DO IT ....
	//Do what you love to do and give it your very best. Whether it's business or baseball, or the theater, or any field.
	//If you don't love what you're doing and you can't give it your best, get out of it. Life is too short. You'll be an old man before you know it.
	//Don't aim for success if you want it; just do what you love and believe in, and it will come naturally.
static int n; static long m; static int ans;static long count; static int flag;
static int arr[];static int arr2[];static boolean visited[];
static ArrayList<pair> s[];static ArrayList<Integer>list;
static class pair{char first;char second;public pair(char x,char y){first=x;second=y;}}
    public static void main(String[] args) throws FileNotFoundException {
    	// InputReader in = new InputReader(System.in);
       //  OutputWriter out = new OutputWriter(System.out);
    	Scanner sc=new Scanner (System.in);
         String s=sc.next();
         System.out.print((s.length()+1)*26-s.length());
        		 

        
     }

    	  
    	  
    	
    }