Prime Sandwhich

/*
 *  Program:
 *  Program:
 *  Programmer: Stanton Moore
 *  Date:
 *  School: Ashe County High School
 */

package prime.sandwich;

import java.util.Scanner;

public class PrimeSandwich
{
    public static void main(String[] args)
    {
        Scanner input=new Scanner(System.in);
        int n;
        System.out.print("Enter an integer greater than or equal to 2: ");
        n= input.nextInt();
        if (n != -1)
        {
            findPrime(n);
        }
    }
    static void findPrime(int input)
        {
            boolean findLargestPrimeNext = true, findSmallestPrimeNext = true;
            String findLargestPrimeNext_result = null, findSmallestPrimeNext_result = null;
            while (findLargestPrimeNext)
            {
                for (int i = input; ; i++)
                {
                    if (isPrime(i))
                    {
                        findLargestPrimeNext = false;
                        findLargestPrimeNext_result = Integer.toString(i);
                        break;
                    }
                }
            }
            while (findSmallestPrimeNext)
            {
                for (int i = input; ; i--)
                {
                    if (isPrime(i))
                    {
                        findSmallestPrimeNext = false;
                        findSmallestPrimeNext_result = Integer.toString(i);
                        break;
                    }

                }
            }
            System.out.println(input + " is between the prime numbers " + findSmallestPrimeNext_result +" and " + findLargestPrimeNext_result);
        }

    static boolean isPrime(int n)
        {

            if (n == 1) return false;
            if (n == 2) return true;

            for (int i = 3; i < n; i += 2)
            {
                if (n % i == 0) return false;
            }

            return true;
        }
}