package com711;import java.util.ArrayList;
import java.util.Collections;
import java.util.List;public class Solution866 {public int primePalindrome(int N) {List<Integer> list = getPalindrome(N);Collections.sort(list);return list.get(0);}public List<Integer> getPalindrome(int N) {List<Integer> list = new ArrayList<Integer>();// 10以内的特例for (int i = N; i < 10; i++) {if (isPrime(i)) {list.add(i);return list;}}int start = getMinStart(N);// 双数的判断for (int i = (int) Math.pow(10, start); i < 10000; i++) {int num = Integer.parseInt(i + "" + reverse(i));if (num >= N && isPrime(num) && num < 200000000) {list.add(num);break;}}for (int i = (int) Math.pow(10, start); i < 10000; i++) {for (int j = 0; j <= 9; j++) {int num1 = Integer.parseInt(i + "" + j + reverse(i));if (num1 >= N && isPrime(num1) && num1 < 200000000) {                  list.add(num1);return list;}}}return list;}public boolean isPrime(int n) {if (n == 1) {return false;}for (int i = 2; i <= Math.sqrt(n); i++) {if (n % i == 0) {return false;}}return true;}public String reverse(int n) {char[] chars = (n + "").toCharArray();int len = chars.length;for (int i = 0; i < len / 2; i++) {char temp = chars[i];chars[i] = chars[len - i - 1];chars[len - i - 1] = temp;}return new String(chars);}public boolean isHuiWen(int n) {char[] chars = (n + "").toCharArray();int len = chars.length;for (int i = 0; i < len; i++) {if (chars[i] != chars[len - i - 1]) {return false;}}return true;}public int getMinStart(int n) {String str = n + "";str = str.substring(0, str.length() / 2);return str.length() / 2;}public static void main(String[] args) {// TODO Auto-generated method stubSolution866 s = new Solution866();long start = System.currentTimeMillis();System.out.println(s.primePalindrome(85709140));long end = System.currentTimeMillis();System.out.println(end - start);}}