Problem G: Good Subject

Xem dạng PDF

Gửi bài giải

Điểm: 1,00
Giới hạn thời gian: 1.0s
Giới hạn bộ nhớ: 256M
Input: stdin
Output: stdout

Tác giả:
Dạng bài

Trong trường hợp đề bài hiển thị không chính xác, bạn có thể tải đề bài tại đây: Đề bài

In UMT, the students are encouraged to embrace a well-rounded education, combining creativity, technology, and business acumen. One of the traditions at UMT is the "Code Sprint" event, where students compete to solve problems that represent UMT's core values of flexibility, adaptability, and innovation.

Today, you are tasked with a simple yet symbolic problem that captures the essence of UMT's philosophy. The letters "U", "M", and "T" represent three different courses offered at UMT, and students are allowed to take these courses multiple times to become well-rounded professionals. Your task is to count how many times each letter appears in a given sequence of characters..


Input

The first line contains a single integer ~n~ ~(1 ≤ n ≤ 100)~ the number of characters in the sequence.

The second line contains a string of n uppercase English letters.


Output

Print three integers, representing the number of times the characters 'U', 'M', and 'T' appear in the sequence, in that order.


Sample Input 1

7
UMTUMTT

Sample Ouput 1

2 2 3


Bình luận

Hãy đọc nội quy trước khi bình luận.


Không có bình luận tại thời điểm này.