The city park of IT City contains *n* east to west paths and *n* north to south paths. Each east to west path crosses each north to south path, so there are *n*<sup class="upper-index">2</sup> intersections.

The city funded purchase of five benches. To make it seems that there are many benches it was decided to place them on as many paths as possible. Obviously this requirement is satisfied by the following scheme: each bench is placed on a cross of paths and each path contains not more than one bench.

Help the park administration count the number of ways to place the benches.
The only line of the input contains one integer *n* (5 ≤ *n* ≤ 100) — the number of east to west paths and north to south paths.
none
5
120
6
4320
7
52920
15
1082161080
17
4594961280
72
23491596420472320
83
101159538130177920
95
402852449038723320
99
613867215317368320
100
680185280130048000
# /**
#  *     author: brownfox2k6
#  *    created: 16/08/2023 16:02:56 Hanoi, Vietnam
# **/

sq = lambda x : x**2

n = int(input())

print(sq(n) * sq(n-1) * sq(n-2) * sq(n-3) * sq(n-4) // 120)