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.
from collections import defaultdict

N = int(input())

min_list = ['M', 'T', 'W', 'TH', 'F', 'S', 'SU']
max_list = ['S', 'SU', 'M', 'T', 'W', 'TH', 'F']

min_dict = defaultdict(int)
max_dict = defaultdict(int)

for i in range(N):
    min_dict[min_list[i % 7]] += 1
    max_dict[max_list[i % 7]] += 1

print('{0} {1}'.format(min_dict['S'] + min_dict['SU'], max_dict['S'] + max_dict['SU']))
