package Problem3;

public class LargestPrimeFaktor
{
	static long s = 114;
	static long primefa = 0;

	public static void main(String[] args)
	{
		factor();
		System.out.print(primefa);
	}

	public static void factor()
	{
		for(long i = s; i >=1 ; --i)
		{

			if(s % i == 0 && isPrime(i) == true)
			{
				primefa = i;
				break;
			}
		}
	}

	public static boolean isPrime(long n)
	{
		if (n <= 1)
			return false;

		for (int i = 2; i < Math.sqrt(n); i++)
		{
			if (n % i == 0)
				return false;
		}
		return true;
	}
}