Problem:
Score : 100 points

Problem Statement

Takahashi wants to print a document with N pages double-sided, where two pages of data can be printed on one sheet of paper.

At least how many sheets of paper does he need?

Constraints

N is an integer.

1 \leq N \leq 100

Input

Input is given from Standard Input in the following format:

N

Output

Print the answer.

Sample Input 1

5

Sample Output 1

3

By printing the 1-st, 2-nd pages on the 1-st sheet, 3-rd and 4-th pages on the 2-nd sheet, and 5-th page on the 3-rd sheet, we can print all the data on 3 sheets of paper.

Sample Input 2

2

Sample Output 2

1

Sample Input 3

100

Sample Output 3

50

Solution in C (GCC 5.4.1) (judge verdict: Wrong Answer)

/*
Anki:未済
作成日:①2020/03/01
*/

#include <stdio.h>

int main(void)
{
    int bingo[3][3], N, i, j, k;

    for ( i = 0; i < 3; i++ )
    {
        for ( j = 0; j < 3; j++ )
        {
            bingo[i][j] = scanf( "%d", &bingo[i][j] );
        }
    }
    scanf( "%d", &N );

    int b[N];
    for ( k = 0; k < N; k++ )
    {
        scanf( "%d", &b[k] );
    }

    for ( i = 0; i < 3; i++ )
    {
        for ( j = 0; j < 3; j++ )
        {
            for ( k = 0; k < N; k++ )
            {
                if ( bingo[i][j] == b[k] )
                    bingo[i][j] = 0;
            }
        }
    }

    if( bingo[0][0] + bingo[1][1] + bingo[2][2] == 0 ||
        bingo[0][2] + bingo[1][1] + bingo[2][0] == 0 ||
        bingo[0][0] + bingo[0][1] + bingo[0][2] == 0 ||
        bingo[1][0] + bingo[1][1] + bingo[1][2] == 0 ||
        bingo[0][0] + bingo[1][0] + bingo[2][0] == 0 ||
        bingo[0][1] + bingo[1][1] + bingo[2][1] == 0 ||
        bingo[0][2] + bingo[1][2] + bingo[2][2] == 0 )
    {
        printf("Yes\n");
        return 0;
    }
    printf("No\n");

    return 0;
}