Take a non-symmetric distribution and assume its median exists and you know what it is in advance (call it $\mu$). Then, draw a very large number of independent samples from it (a large multiple of some integer, $n$). Now, divide into groups of $n$ (first $n$ samples in the first group, next $n$ samples in the second group and so on). Find the median for each of these groups. Then, take the median across all these calculate medians. Will this resulting median of medians always be very close to $\mu$ for all (or most) distributions. It is well known that the mean of these medians will be far from $\mu$. However, simulations show me that the median of medians is very very close for a variety of distributions. But can this be proven?
See plot below where I took the median of 100,000 medians where each individual median was from 11 samples for the LogLogistic distribution. The black line ($\mu$) is plum behind the orange line (median of medians). Seems to hold for many other distributions as well.
Code used for generating the plot: https://gist.github.com/ryu577/420d6a9e56b21d3e7038660e3a9a88f5