#K11611. Serial Number Combination Count

    ID: 23508 Type: Default 1000ms 256MiB

Serial Number Combination Count

Serial Number Combination Count

You are required to compute the total number of unique serial numbers that can be generated. Each serial number is composed of exactly 4 distinct uppercase English letters and these letters must appear in lexicographical order.

The mathematical formulation behind the problem is based on combinations. Specifically, the total number is given by the expression:

\(\binom{26}{4} = \frac{26!}{4!\,(26-4)!} = 14950\)

Your task is to output this computed value. Although no meaningful input is needed for this computation, the program must read from standard input as per the competition guidelines.

inputFormat

The input consists of a single line containing any non-empty dummy string. The input has no impact on the result, so you may ignore its content.

outputFormat

Print a single integer which is the total number of unique serial numbers possible, i.e., 14950.

## sample
dummy1
14950