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;
const int N = 1e5 + 100;
const double PI = 3.14159;
vector<int> v;
long long n, m, k, d, ans[101], c, sum, a[105][105], mn, mx;
set<string> st;
string s, b;
bool flag;
set<string>::iterator it;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cin >> n;
  mn = n / 7;
  mn *= 2;
  mx = mn;
  if (n % 7 != 0) {
    if (n % 7 == 1)
      mx++;
    else
      mx += 2;
  }
  if (n % 7 == 6) mn++;
  cout << mn << " " << mx << endl;
  return 0;
}
