Initially, all edges of the $K_{2024}$ are painted with $13$ different colors. If there exist $k$ colors such that the subgraph constructed by the edges which are colored with these $k$ colors is connected no matter how the initial coloring was, find the minimum value of $k$.