407964: GYM102953 1 Banner Display

You're trying to make several banners that say "coderams" on them, for an upcoming in-person coding competition. However, you have a limited number of letter stickers that you can use. All you have is a long string of $$$n$$$ lowercase letter stickers. Given this, your task is to figure out the maximum possible number of complete banners (that say "coderams" on them, not just part of the string), given the letter stickers that you have.

The first line of input consists of a single positive integer $$$n$$$ $$$(1 <= n <= 10^5)$$$: the number of letter stickers that you have.

The next line consists of a single $$$n$$$-character string, each character representing the letter of one sticker that you have. All stickers will have lowercase letters on them.

Output the number of complete banners that you can make with the letter stickers you have.

Full problem: 6 points

18
arcmodessmarcodarc

1

4
code

0

32
ramscodecoderamsramscodecoderams

4