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.
n=int(input())
if n>=7 and n!=8:
    mn=0
    k=n
    while k>=7:            #находим минимум
               k, mn=(k-7), (mn+2)
               if k<7 and k-5>0:
                         mn+=k-5
    mx=2
    n-=2
    while n>=7:           #находим максимум
               n, mx=(n-7), (mx+2)
               if n<7 and n-5>0:
                         mx+=n-5
    print(mn, mx)
else:
          if n==8:
                    print(2, 3)
          if n==6:
                    print(1, 2)
          if n==5 or n==4 or n==3 or n==2:
                    print(0, 2)
          if n==1:
                    print(0, 1)