I

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.

#include <iostream>
using namespace std;
int main()
{
    long long int a;
    cin >> a;
    if(a%7==0)
    {
        cout << (a/7)*2 << " " << (a/7)*2;
    }
    if(a%7!=0)
    {
        if(a<7)
        {
            if(a<=5&&a>1)
            {
                cout << 0 << " " << 2;
            }
            else if(a==1)
            {
                cout << 0 << " " << 1;
            }
            else
            {
                cout << 1 << " " << 2;
            }
        }
        else
        {
            if((a+6)%7==0)
            {
                cout << (a/7)*2 << " " << (a/7)*2+1;
            }
            else if((a+1)%7==0)
            {
                cout << (a/7)*2+1 << " " << (a/7)*2+2;
            }
            else
            {
                cout << (a/7)*2 << " " << (a/7)*2+2;
            }
        }
    }
    return 0;
}