It's Hip to be Square Challenge
So, um, it seems that, while we have plenty of challenges that work with square numbers or numbers of other shapes, we don't have one that simply asks:
Given an integer n (where n&gt;=0) as input return a truthy value if n is a perfect square or a falsey value if not.

Rules

You may take input by any reasonable, convenient means as long as it's permitted by standard I/O rules.
You need not handle inputs greater than what your chosen language can natively handle nor which would lead to floating point inaccuracies.
Output should be one of two consistent truthy/falsey values (e.g., true or false, 1 or 0) - truthy if the input is a perfect square, falsey if it's not.
This is code-golf so lowest byte count wins.


Test Cases
Input:  0
Output: true

Input:  1
Output: true

Input:  64
Output: true

Input:  88
Output: false

Input:  2147483647
Output: false
Neim, 2 bytes

q


Explanation:

q      Push an infinite list of squares
      Is the input in that list?


When I say 'infinite' I mean up until we hit the maximum value of longs (2^63-1). However, Neim is (slowly) transitioning to theoretically infinitely large BigIntegers.

Try it!