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.
"""
Codeforces Round #334 (Div. 2)

Problem 670 A. Holidays

@author yamaton
@date 2015-05-05
"""

import itertools as it
import functools
import operator
import collections
import math
import sys


def lo(n):
    k = max(n - 5, 0)
    return min(2, k % 7) + 2 * (k // 7)


def solve(n):
    q = max(n - 2, 0)
    hi = lo(q) + min(2, n)
    return lo(n), hi


def pp(*args, **kwargs):
    return print(*args, file=sys.stderr, **kwargs)


def main():
    n = int(input())
    result = solve(n)
    print(*result)


if __name__ == '__main__':
    main()
