Sicily 1568. WonderTeam

1568. WonderTeam

Constraints

Time Limit: 1 secs, Memory Limit: 32 MB

Description

The Brasileiro League is the most important event in Brazil. There are n football teams participating in the competitions, each team plays twice (home and away) against each other team. Each team receives three points for a win and one point for a draw. No point is awarded for a loss. 

When the games are finished, teams are ranked by numbers from 1 to n according to the total points. The rank of each team t having p points is one plus the number of teams having more than p points. It is possible that more than one team have the same ranks. 

In addition to the Champion (the 1st ranked team or teams), the WonderTeam is also awarded, if there exists one. The team that has absolutely the highest number of wins (absolutely means no other teams has the same number of wins), absolutely the highest number of goals scored, and absolutely the lowest number of goals conceded, is called the WonderTeam. (WonderTeam should have all these properties.) 

Your task is to find out the worst possible rank for the WonderTeam.

Input

There are multiple test cases in the input. Each test case consists of only one line containing n (1 ? n ? 50), the number of teams in league. The input terminates with a line containing 0.

Output

For each test case, write a single line containing the worst possible rank for the WonderTeam.

Sample Input

1
3
0

Sample Output

1
1
// Problem#: 1568
// Submission#: 3319961
// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License
// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/
// All Copyright reserved by Informatic Lab of Sun Yat-sen University
#include <algorithm>
#include <iostream>
#include <string>
#include <stdio.h>
#include <queue>
#include <string.h>
#include <vector>
#include <iomanip>
#include <map>
#include <stack>
#include <functional>
#include <list>
#include <cmath>
using namespace std;

int main() {

    std::ios::sync_with_stdio(false);

    while (1) {
        int n;
        cin >> n;
        if (!n) break;
        cout << (n >= 5 ? n : (n == 4 ? 2 : 1)) << endl;
    }

    //getchar();
    //getchar();
    
    return 0;
}