On the planet Mars a year lasts exactly n days (there are no leap years on Mars). But Martians have the same weeks as earthlings — 5 work days and then 2 days off. Your task is to determine the minimum possible and the maximum possible number of days off per year on Mars.

Input

The first line of the input contains a positive integer n (1 ≤ n ≤ 1 000 000) — the number of days in a year on Mars.

Output

Print two integers — the minimum possible and the maximum possible number of days off per year on Mars.

Examples

Input

14


Output

4 4


Input

2


Output

0 2

Note

In the first sample there are 14 days in a year on Mars, and therefore independently of the day a year starts with there will be exactly 4 days off .

In the second sample there are only 2 days in a year on Mars, and they can both be either work days or days off.
class CodeforcesTask670ASolution:
    def __init__(self):
        self.result = ''
        self.n = 0

    def read_input(self):
        self.n = int(input())

    def process_task(self):
        r = self.n % 7
        off = (self.n // 7) * 2
        d = 0
        if r == 6:
            d = 1
        self.result = "{0} {1}".format(off + d, off + min(2, r))

    def get_result(self):
        return self.result


if __name__ == "__main__":
    Solution = CodeforcesTask670ASolution()
    Solution.read_input()
    Solution.process_task()
    print(Solution.get_result())
