O(n log n) algorithm for finding a solution of Erdős-Ginzburg-Ziv theorem

Erd\H{o}s-Ginzburg-Ziv theorem is a popular theorem in additive number theory, which states any sequence of $2n-1$ integers contains a subsequence of $n$ elements, with their sum is a multiple of $n$. In this article, we provide an algorithm finding a solution of Erd\H{o}s-Ginzburg-Ziv in $O(n \log n)$ time. This is the first known quasi-linear time algorithm finding a solution of Erd\H{o}s-Ginzburg-Ziv theorem.