CodeForces 670A Holidays(水题)

来源:互联网 发布:java调用本地程序 编辑:程序博客网 时间:2024/06/01 10:47

思路:水题


#include<bits\stdc++.h>using namespace std;int main(){int n;scanf("%d",&n);int Max = 0;int Min = 999999;for (int i = 0;i<7;i++){int temp = 0;int day = i;for (int i = 0;i<n;i++){if (day<2){temp++;}            day = (day+1)%7;}//int Max = 0;//int Min = 99999999;Max = max(Max,temp);Min = min(Min,temp);}printf("%d %d\n",Min,Max);}

Description

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.

Sample Input

Input
14
Output
4 4
Input
2
Output
0 2


0 0
原创粉丝点击