Mykola, Nazar, and Serhiy are members of an Olympiad programming club. Due to the implementation of adaptive quarantine measures to prevent student gatherings, it has been decided that Mykola will attend the club every days, Nazar every days, and Serhiy every days.
Your task is to determine the number of days from the start of the quarantine until all three of them meet at the club on the same day.
The first line contains three natural numbers separated by a single space: , , (1 \leq M, N, S \leq 10000).
Output a single number, which is the minimum number of days after the quarantine starts when Mykola, Nazar, and Serhiy will all be at the club together.
Example 1