Given the task definition, example input & output, solve the new input case.
In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Example: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
d is ocurring with maximum frequency of 5.

New input case for you: oyuodtxzpuxspsacrzdcfxvprrvtxxzkhhndanlehlqdyeyd
Output:
d