corejava-programming: find nearest factorial

import java.util.Scanner;

public class NearestFactorial{
public static void main(String s1[]){
Scanner input = new Scanner(System.in);
int num=input.nextInt();
int i=1;
int result=1;
int temp=1;
while(!(result*i>num)){
result=result*i;
if(result==num){
System.out.println(num);
break;
}
i++;
temp=result*i;
}
if(result!=num) {
int diff=num-result;
int diff1=temp-num;
if(diff>=diff1)
System.out.println(temp);
else
System.out.println(result);
}
}
}