c# solution
Code
# Code
```csharp []
public class Solution {
    public int PrimePalindrome(int n) {
        if (n <= 2)
        {
            return 2;
        }

        for (int j = n; j < 1000000000; j++)
        {
            if (j % 2 == 0)
                continue;

            int x = j;
            int count = 0;
            int[] res = new int[10];
            while (x > 0)
            {
                res[count] = x % 10;
                x /= 10;
                count++;
            }

            bool pol = true;
            for (int i = 0; i < count / 2; i++)
            {
                if (res[i] != res[count-i-1])
                {
                    pol = false;
                    break;
                }
            }

            if (!pol)
            {
                continue;
            }


            bool prime = true;
            for (int i = 2; i <= Math.Sqrt(j)+1; i++)
            {
                if (j % i == 0)
                {
                    prime = false;
                    break;
                }
            }

            if (!prime)
            {
                continue;
            }

            return j;
        }
        return -1;
    }
}
```
['C#']