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# (.NET Core 3.1.201) (judge verdict: Wrong Answer)

using System;
using System.Text;
using System.Linq;
using System.Collections;
using System.Collections.Generic;
using static System.Console;
using static System.Math;

namespace AtCoder
{
    public class Program
    {
        public static void Main(string[] args)
        {
            new Program().Solve(new ConsoleInput(Console.In, ' '));
        }

        public void Solve(ConsoleInput cin)
        {
            var num = cin.ReadInt;
            int leftnum = 400;
            int rightnum = 599;
            int couter = 8;
            if (num < leftnum) {

            }
            while (rightnum < 2000) {
                if (num < rightnum)
                {
        
                    break;
                }
                couter--;

                    rightnum+=200;

            }

            WriteLine(couter);

            //var num = cin.ReadInt;
            //int[] array = cin.ReadIntArray(num);
            //List<int> list = array.ToList();



            ////for (int i =0; i < num; i++) {
            ////    list.Add(array[i]);

            ////}
            //foreach (var x in list)
            //{
            //    WriteLine(x);
            //}

            //WriteLine(list.First();


            //var nk = Console.ReadLine().Split(' ');
            //var n = int.Parse(nk[0]);
            //var k = int.Parse(nk[1]);

            //var t = new int[n][];
            //for (int i =0; i < n;i++) {
            //    t[i] = cin.ReadIntArray(n);
            //}

            //int n = cin.ReadInt;
            //int K = cin.ReadInt;

            //int[] array = new int[n];

            //for (int i =0; i < n; i++) {
            //    array[i] = cin.ReadInt;
            //}

            //for (int i =0; i < n; i++) {
            //    if (array[i] == 0) {
            //        WriteLine(n);
            //    }
            //}

            //int res = 0;
            //int right = 0;
            //long mult = 1;

            //for (int left = 0; left < n; left++) {
            //    while (right < n && mult * array[right] <= K) {
            //        mult *= array[right];
            //        right++;
            //    }

            //    res = Math.Max(res, right - left);
            //    if (left == right) right++;
            //    else mult /= array[left];


            //}
            //WriteLine(res);
        }
    }

    public class ConsoleInput
    {
        private readonly System.IO.TextReader _stream;
        private char _separator = ' ';
        private Queue<string> inputStream;
        public ConsoleInput(System.IO.TextReader stream, char separator = ' ')
        {
            this._separator = separator;
            this._stream = stream;
            inputStream = new Queue<string>();
        }
        public string Read
        {
            get
            {
                if (inputStream.Count != 0) return inputStream.Dequeue();
                string[] tmp = _stream.ReadLine().Split(_separator);
                for (int i = 0; i < tmp.Length; ++i)
                    inputStream.Enqueue(tmp[i]);
                return inputStream.Dequeue();
            }
        }
        public string ReadLine { get { return _stream.ReadLine(); } }
        public int ReadInt { get { return int.Parse(Read); } }
        public long ReadLong { get { return long.Parse(Read); } }
        public double ReadDouble { get { return double.Parse(Read); } }
        public string[] ReadStrArray(long N) { var ret = new string[N]; for (long i = 0; i < N; ++i) ret[i] = Read; return ret; }
        public int[] ReadIntArray(long N) { var ret = new int[N]; for (long i = 0; i < N; ++i) ret[i] = ReadInt; return ret; }
        public long[] ReadLongArray(long N) { var ret = new long[N]; for (long i = 0; i < N; ++i) ret[i] = ReadLong; return ret; }
    }
}