rlm@0: package coderloop;
rlm@0: 
rlm@0: import java.io.File;
rlm@0: import java.util.Scanner;
rlm@0: 
rlm@0: class Collatz {
rlm@0:     public static void main(String[] args)throws java.io.FileNotFoundException{
rlm@0: 	File file = new File(args[0]);
rlm@0: 	Scanner scanner = new Scanner(file);
rlm@0: 	int n = scanner.nextInt();
rlm@0: 	System.out.println(search_collatz(n));}
rlm@0:     
rlm@0:     public static long collatz_next(long n){
rlm@0: 	if (0 == (n % 2)){
rlm@0: 	    return n/2;}
rlm@0: 	else {
rlm@0: 	    return (1 + (n * 3));}}
rlm@0:     
rlm@0:     public static int collatz_length(int n){
rlm@0: 	long t = n;
rlm@0: 	int d = 1;
rlm@0: 	while (t > 1){
rlm@0: 	    t = collatz_next(t);
rlm@0: 	    d++;}
rlm@0: 	return d;}
rlm@0:     
rlm@0:     public static int search_collatz(int n){
rlm@0: 	int max = 0;
rlm@0: 	int max_val = 0;
rlm@0: 	int temp_val = 0;
rlm@0: 	for (int i = 1; i<n; i++){
rlm@0: 	    temp_val = collatz_length(i);
rlm@0: 	    if (temp_val > max_val){
rlm@0: 		max = i;
rlm@0: 		max_val = temp_val;}}
rlm@0: 	return max;}
rlm@0: }