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() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  int hol = 0;
  if (n == 1)
    cout << 0 << " " << 1 << endl;
  else if (n >= 2 && n <= 5)
    cout << 0 << " " << 2 << endl;
  else if (n == 6)
    cout << 1 << " " << 2 << endl;
  else {
    int week_count = (n / 7);
    int extra = (n % 7);
    if (extra == 6)
      cout << week_count * 2 + 1 << " ";
    else
      cout << week_count * 2 << " ";
    if (extra == 0)
      cout << week_count * 2 << endl;
    else if (extra == 1)
      cout << week_count * 2 + 1 << endl;
    else
      cout << week_count * 2 + 2 << endl;
  }
}
