Problem:
Score: 100 points

Problem Statement

M-kun is a competitor in AtCoder, whose highest rating is X.

In this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:

From 400 through 599: 8-kyu

From 600 through 799: 7-kyu

From 800 through 999: 6-kyu

From 1000 through 1199: 5-kyu

From 1200 through 1399: 4-kyu

From 1400 through 1599: 3-kyu

From 1600 through 1799: 2-kyu

From 1800 through 1999: 1-kyu

What kyu does M-kun have?

Constraints

400 \leq X \leq 1999

X is an integer.

Input

Input is given from Standard Input in the following format:

X

Output

Print the kyu M-kun has, as an integer.
For example, if he has 8-kyu, print 8.

Sample Input 1

725

Sample Output 1

7

M-kun's highest rating is 725, which corresponds to 7-kyu.

Thus, 7 is the correct output.

Sample Input 2

1600

Sample Output 2

2

M-kun's highest rating is 1600, which corresponds to 2-kyu.

Thus, 2 is the correct output.

Solution in C (Clang 10.0.0) (judge verdict: Runtime Error)

#include <stdio.h>
#include <math.h>
#include <stdlib.h>

int main (void) {
    int A[90], N, K;
    int i, j, count=0, label=0;
    unsigned long int maisuu=0, money=0;
    
    scanf("%d", &N);
    for(i=0; i<N; i++) {
        scanf("%d", &A[i]);
        
    }
    
    for(i=0; i<N; i++){
        if(A[i] < A[i+1] && count == 0) { /*買えばいい*/
            
            maisuu = money/A[i];
            money = money % A[i];
            count = 1;
        }
        
        
        if(A[i] > A[i+1] && count == 1) { /*売ればいい*/
            money += maisuu*A[i];
            maisuu = 0;
            
            
            count = 0;
        }
    }
    
    
    printf("%d\n",money);
    
    return 0;
}