Worst Java Solution
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: O(1)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public boolean isFascinating(int n) {\n        return n == 192 || n == 219 || n == 273 || n == 327;\n    }\n}\n```\n![\u043F\u04352.jpg](https://assets.leetcode.com/users/images/5ecc1b5b-8a66-4bef-a27b-d8884c51a9e2_1690462296.7836988.jpeg)\n
['Number Theory', 'Java']