UOSPC Count

Interview

Time limit1sMemory limit1024 MB

Summary

Rearrange the letters of S to form as many copies of uospc as possible, and print that maximum count.

Level: Easy2 of 10
Topics: String, Implementation
Solved: No attempts yet

Problem

A fox that lives on Baebong Mountain likes playing with strings. Among all shapes, the fox likes uospc the most! The fox wants to rearrange the characters of its string so that it can form as many uospc shapes as possible. For example, rearranging 'suspicion' gives uospcsiin, and rearranging 'processyourpurchase' gives uospcuospcreyrrhase.

Given a string $S$ of lowercase English letters, find the maximum number of uospc that a clever fox can obtain by rearranging the characters of $S$ .

Input

The first line contains an integer $n$ , the length of the string ( $1\leq n \leq 1\ 000$ ).

The second line contains the string $S$ of length $n$ , consisting only of lowercase English letters.

Output

Print the maximum number of uospc that can be formed by rearranging the characters of $S$ .

Examples2

Example 1
Input
```
9
suspicion
```
Expected output
```
1
```
Example 2
Input
```
19
processyourpurchase
```
Expected output
```
2
```