Count Beautiful Palindromes

Given an integer n, your task is to compute the number of distinct beautiful palindromes of length n. A palindrome is a string that reads the same forwards and backwards. In this problem, we consider a beautiful palindrome to be one where every character in the string is identical. Since there are 26 letters in the English alphabet, the number of beautiful palindromes is always given by $$\text{Count}(n)=26$$, regardless of the value of n (with n being at least 1).

Note: The input will be a single integer n representing the length of the palindrome. You need to output the number 26.

inputFormat

The input consists of a single integer n (1 \le n \le 10^5), which is the length of the palindrome.

The input is provided via standard input (stdin).

outputFormat

Output a single integer – the number of beautiful palindromes of length n. The result should be printed to standard output (stdout).

1

26