<p>Given a string <code>s</code> containing an out-of-order English representation of digits <code>0-9</code>, return <em>the digits in <strong>ascending</strong> order</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> s = "owoztneoer"
<strong>Output:</strong> "012"
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> s = "fviefuro"
<strong>Output:</strong> "45"
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s.length &lt;= 10<sup>5</sup></code></li>
	<li><code>s[i]</code> is one of the characters <code>[&quot;e&quot;,&quot;g&quot;,&quot;f&quot;,&quot;i&quot;,&quot;h&quot;,&quot;o&quot;,&quot;n&quot;,&quot;s&quot;,&quot;r&quot;,&quot;u&quot;,&quot;t&quot;,&quot;w&quot;,&quot;v&quot;,&quot;x&quot;,&quot;z&quot;]</code>.</li>
	<li><code>s</code> is <strong>guaranteed</strong> to be valid.</li>
</ul>

class Solution:
    def originalDigits(self, s: str) -> str:
        '''
        
        
        
        nine
        '''
        res=[]
        data=Counter(s)
        for i in s:
            if i=='w':
                data['t']-=1
                data['w']-=1
                data['o']-=1
                res.append('2')
            elif i=='z':
                data['z']-=1
                data['e']-=1
                data['r']-=1
                data['o']-=1
                res.append('0')
            elif i=='u':
                data['f']-=1
                data['o']-=1
                data['u']-=1
                data['r']-=1
                res.append('4')
            elif i=='x':
                data['s']-=1
                data['i']-=1
                data['x']-=1
                res.append('6')
            elif i=='g':
                data['e']-=1
                data['i']-=1
                data['g']-=1
                data['h']-=1
                data['t']-=1
                res.append('8')
        while data['f']>0:
            data['f']-=1
            data['i']-=1
            data['v']-=1
            data['e']-=1
            res.append('5')
        while data['o']>0:
            data['o']-=1
            data['n']-=1
            data['e']-=1
            res.append('1')
        while data['r']>0:
            data['t']-=1
            data['h']-=1
            data['r']-=1
            data['e']-=2
            res.append('3')
        while data['s']>0:
            data['s']-=1
            data['e']-=2
            data['v']-=1
            data['n']-=1
            res.append('7')
        while data['i']>0:
            data['n']-=2
            data['i']-=1
            data['e']-=1
            res.append('9')
        
        return ''.join(sorted(res))
        
17100