The capacity of a multiple-input multiple-output (MIMO) identity channel under the peak and average power constraints is investigated. The approach of Shamai et al. is generalized to the higher dimension settings to derive the necessary and sufficient conditions for the optimal input probability density function. This approach prevents the usage of the identity theorem of the holomorphic functions of several complex variables which seems to fail in the multi-dimensional scenarios. It is proved that in the spherical coordinates, the magnitude and phases of the capacity-achieving distribution are mutually independent and its support is a finite set of hyper-spheres where the points are uniformly distributed on them. Subsequently, it is shown that when the average power constraint is relaxed, if the number of antennas is large enough (e.g. massive MIMO), the capacity has a closed form solution and constant amplitude signaling at the peak power achieves it. Finally, it will be observed that in a discrete-time memoryless Gaussian channel, the average power constrained capacity, which results from a Gaussian input distribution, can be closely obtained by an input where the support of its magnitude is a discrete finite set.