Running time of heap sort, when all number are identical

Given n numbers that all are identical, then what would be the running time of heap sort?

Will it be in linear time O(n) or, best case O(n log n)