Beautiful Year in java

It seems like the year of 2013 came only yesterday. Do you know a curious fact? The year of 2013 is the first year after the old 1987 with only distinct digits.

Now you are suggested to solve the following problem: given a year number, find the minimum year number which is strictly larger than the given one and has only distinct digits.

Input Format

The single line contains integer y (1000 ≤ y ≤ 9000) — the year number

Output Format

Print a single integer — the minimum year number that is strictly larger than y and all its digits are distinct. It is guaranteed that the answer exists.

Example 1

Input

1987

Output

2013

Constraints:

1000 ≤ y ≤ 9000

Solution of Beautiful Year in java:–

import java.util.*;
import java.lang.*;
import java.io.*;

public class Main
{
	public static void main (String[] args) throws java.lang.Exception
	{
		//your code here
      Scanner sc=new Scanner(System.in);
     int n=sc.nextInt();
      int temp=0;
      for(int i=0;i<8000;i++)
        { 
            n++;
            temp=n;
            int a=temp%10;
            temp=temp/10;
            int b=temp%10;
            temp=temp/10;
            int c=temp%10;
            temp=temp/10;
            int d=temp;
            if(a!=b && a!=c && a!=d && b!=c && b!=d && c!=d)
            {
              System.out.print(d+""+c+""+b+""+a);
              break;
            }
        }
	}
}