USING CPP o(n^2)
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\nprivate:\n    bool ispalindrom(int num){\n        int num2 = num;\n        int result = 0;\n        while(num){\n            int last = num%10;\n            result = result *10 + last;\n            num = num/10;\n        }\n        return num2==result;\n    }\nprivate:\n    bool isprime(int num){\n    if (num < 2) {\n        return false;\n    }\n    for (int i = 2; i * i <= num; ++i) {\n        if (num % i == 0) {\n            return false;\n        }\n    }\n    return true;\n}\n\nprivate:\n    int issues(int num){\n        if(ispalindrom(num) && isprime(num)){\n            return num;\n        }\n        return issues(num+1);\n    }\npublic:\n    int primePalindrome(int num) {\n        if(1e7<=num && num<=1e8){\n            return 100030001;\n        }\n        int ans = issues(num);\n        return ans;\n        }\n    };\n\n```
['C++']