Assume that you are using a hash algorithm that produces output or signatures that are $2^4$ bits in length. Assuming the hash function returns a different output for every input, what is the maximum number of unique inputs that this algorithm can process before there is a collision between two outputs? If you want Canvas to grade your answer enter it as a number with no commas. For example, if the answer is $900,000$ enter $900000.$ Do not enter $900,000$ or nine hundred thousand.