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, resmax = -round(1e9), resmin = round(1e9);
int main() {
  cin >> n;
  for (int i = 1; i <= 7; i++) {
    int j = i, dem1 = 0;
    for (int dem = 1; dem <= n; dem++) {
      if ((j % 7 == 0) || (j % 7 == 6)) dem1++;
      j++;
      if (j > 7) j = 1;
    }
    resmax = max(resmax, dem1);
    resmin = min(resmin, dem1);
  }
  cout << resmin << " " << resmax;
  return 0;
}
