codeforces 670A Holidays

A. Holidays
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

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 <iostream>
#include <cstring>
using namespace std;
int main(){
    int n,l,r;
    cin>>n;
    l=r=n/7*2;
    int mod=n%7;
    if(mod==1) r+=1;
    else if(mod>=2&&mod<=5) r+=2;
    else if(mod==6) l+=1,r+=2;
    cout<<l<<' '<<r<<endl;
    return 0;
}

阅读更多
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页