# ---
# title: 326. Power of Three
# id: problem326
# author: Tian Jun
# date: 2020-10-31
# difficulty: Easy
# categories: Math
# link: <https://leetcode.com/problems/power-of-three/description/>
# hidden: true
# ---
# 
# Given an integer `n`, return _`true` if it is a power of three. Otherwise,
# return `false`_.
# 
# An integer `n` is a power of three, if there exists an integer `x` such that
# `n == 3x`.
# 
# 
# 
# **Example 1:**
# 
#     
#     
#     Input: n = 27
#     Output: true
#     
# 
# **Example 2:**
# 
#     
#     
#     Input: n = 0
#     Output: false
#     
# 
# **Example 3:**
# 
#     
#     
#     Input: n = 9
#     Output: true
#     
# 
# **Example 4:**
# 
#     
#     
#     Input: n = 45
#     Output: false
#     
# 
# 
# 
# **Constraints:**
# 
#   * `-231 <= n <= 231 - 1`
# 
# 
# 
# **Follow up:  **Could you do it without using any loop / recursion?
# 
# 
## @lc code=start
using LeetCode

## add your code here:
## @lc code=end
