Maximum Flower Bloom Days

You are given a single integer \(n\) which represents the number of consecutive days. Three types of flowers bloom periodically: roses every 3 days, tulips every 5 days, and lilies every 7 days.

For each flower type, the number of bloom events in \(n\) days can be computed using the ceiling function:

\[ \text{blooms} = \left\lceil \frac{n}{\text{interval}} \right\rceil = \frac{n + \text{interval} - 1}{\text{interval}} \]

Your task is to determine the maximum number of bloom events among these three flowers during the \(n\) consecutive days.

Input: A single integer \(n\) where \(1 \le n \le 10^9\).

Output: A single integer which is the maximum number of bloom events among the three flowers.

inputFormat

The input consists of a single integer \(n\) provided via standard input (stdin).

outputFormat

Output a single integer representing the maximum number of days any flower (roses, tulips, or lilies) will be in bloom. The output should be written to standard output (stdout).

10

4