Given a string s, find the shortest substring of s that contains every distinct character that appears in s at least once. If there are multiple shortest substrings, return the one that appears first (smallest starting index). Return the substring itself. The input is a single line containing s (1 <= len(s) <= 10^5).
aabcbcdbcadbca