AT_arc212_a [ARC212A] Four TSP

There is a complete graph with four vertices numbered $ 1, 2, 3, 4 $ . You will now assign weights to each of the six edges. Each weight should be a positive integer, and the sum of the six weights should be exactly $ K $ . More formally, you choose positive integers $ x_{i,j} \ (1\leq i

The input is given from Standard Input in the following format: > $ K $

Output the answer.

### Sample Explanation 1 The possible graphs are the ones where one of the six edges has weight $ 2 $ and the other edges have weight $ 1 $ . There are six such graphs $ G $ , and we have $ f(G)=4 $ for each of them, so the answer is $ 24 $ . ### Constraints - $ 6 \le K \le 5000 $ - All input values are integers.