For this Question: You went to shopping. You bought an item worth N rupees. What is the minimum change that you can get from the shopkeeper if you possess only 200 and 500 rupees notes. 

Eg: If N = 678, the minimum change you can receive is 22, if you pay the shopkeeper a 500 and a 200 rupee note. You can show that no other combination can lead to a change lesser than this like (200, 200, 200, 200) or (500, 500). 

Note: You have infinite number of 200 and 500 rupees notes. Enjoy, XD.The first and the only line of input contains an integer N.

Constraints
1 <= N <= 1000000000Output a single integer, the minimum amount of change that you will receive.Sample Input
678

Sample Output
22

Sample Input
900

Sample Output
0, I have written this Solution Code: 
import java.util.*;
import java.lang.*;
import java.io.*;

class Main
{
	public static void main (String[] args) throws java.lang.Exception
	{
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int ans=0;
        if(n <= 200){
          ans = 200-n;
          }
        else if(n <= 400){
        ans=400-n;
        }
        else{
            ans = (100-n%100)%100;
        }
        System.out.print(ans);
       
	    }
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not?