3698 - Upper-Lower Counting

Created by Yonny Mondelo Hernández
Added by dcordb (2016-06-23)
Limits
Total Time: 15000 MS | Test Time: 1000 MS |Memory: 256 MB | Output: 64 MB | Size: 16 KB
Enabled languages
Available in

Description

Given a non-empty string S containing only letters of the English alphabet, you must count how many of them are uppercase letters and how many are lowercase letters.
Dada una cadena no vacía S que contiene sólo letras del alfabeto inglés usted debe contar cuántas de ellas son letras mayúsculas y cuántas son letras minúsculas.
Given a non-empty string S containing only letters of the English alphabet, you must count how many of them are uppercase letters and how many are lowercase letters.

Input specification

The input consists of a single line containing an integer N (1 N 10) followed by a string S that has exactly N letters.
La entrada consiste en una línea que contiene un número entero N seguido por la cadena S (1 <= |S| <= 10); N denota el tamaño de la cadena S.
The input consists of a single line containing an integer N (1 N 10) followed by a string S that has exactly N letters.

Output specification

Output a line with two space-separated integers representing respectively the numbers of uppercase and lowercase letters in S.
Usted debe imprimir una línea con dos números enteros separados por un espacio que representan respectivamente la cantidad de letras mayúsculas y minúsculas en S.
The input consists of a single line containing an integer N (1 N 10) followed by a string S that has exactly N letters.

Sample input

10 UpperLower

Sample output

2 8

Hint(s)