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 n, i, j, ans1 = 666666666, ans2 = -666666666, s, x;
int main() {
  cin >> n;
  for (i = 1; i <= 7; ++i) {
    s = 0;
    x = i;
    for (j = 1; j <= n; ++j) {
      if (x == 6 || x == 7) ++s;
      ++x;
      if (x > 7) x = 1;
    }
    ans1 = min(ans1, s);
    ans2 = max(ans2, s);
  }
  cout << ans1 << " " << ans2 << endl;
  return 0;
}
