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 <bits/stdc++.h>
using namespace std;
int main() {
  int a, b, c, rem = 0;
  cin >> a;
  if (a / 7 <= 0) {
    b = (a > 5) ? b = 7 - a : b = 0;
    c = (a >= 2) ? c = 2 : c = a;
  } else {
    rem = a % 7;
    a /= 7;
    b = a * 2;
    c = a * 2;
  }
  if (rem > 0) {
    (rem > 5) ? b += 7 - rem : b += 0;
    (rem >= 2) ? c += 2 : c += rem;
  }
  cout << b << " " << c << endl;
}
