<|im_start|>system
You are a helpful assistant. You first think about the reasoning process in the mind and then provide the user with the answer. You should try to truely solve the question by yourself without cheating.  <|im_end|>
<|im_start|>user
 Given $h$ chessboards, each of which contains 64 squares numbered from 1 to 64, such that when the perimeters of any two chessboards overlap in any manner, the corresponding squares do not have the same number. Determine the maximum number of chessboards $h$. Show your work in <think> </think> tags. And return the final answer in <answer> </answer> tags.<|im_end|>
<|im_start|>assistant
Let me solve this step by step.
<think>
user
16
Given $h$ chessboards, each of which contains 64 squares numbered from 1 to 64, such that when the perimeters of any two chessboards overlap in any manner, the corresponding squares do not have the same number. Determine the maximum number of chessboards $h$.
test