import
java.util.*;
class
GFG {
static
void
find_freq(String v[],
int
n)
{
Map<String, Integer> mp1 =
new
HashMap<String, Integer>();
Map<String, Integer> mp2 =
new
HashMap<String, Integer>();
int
count1 =
0
, count2 =
0
;
Boolean flag;
for
(
int
i =
0
; i < n; i++) {
flag =
true
;
for
(
int
j =
0
; j < v[i].length(); j++) {
if
(v[i].charAt(j) >=
'0'
&& v[i].charAt(j) <=
'9'
) {
flag =
false
;
break
;
}
}
if
(flag) {
count1++;
if
(mp1.containsKey(v[i]))
{
mp1.put(v[i], mp1.get(v[i]) +
1
);
}
else
{
mp1.put(v[i],
1
);
}
}
else
{
count2++;
if
(mp2.containsKey(v[i]))
{
mp2.put(v[i], mp2.get(v[i]) +
1
);
}
else
{
mp2.put(v[i],
1
);
}
}
}
System.out.println(count1 +
" "
+ count2);
for
(Map.Entry<String, Integer> entry : mp1.entrySet())
{
System.out.println(entry.getKey() +
":"
+ entry.getValue());
}
for
(Map.Entry<String, Integer> entry : mp2.entrySet())
{
System.out.println(entry.getKey() +
":"
+ entry.getValue());
}
}
public
static
void
main (String[] args) {
int
N =
5
;
String arr[] = {
"abcd"
,
"mak87s"
,
"abcd"
,
"kakjdj"
,
"laojs7s6"
};
find_freq(arr, N);
}
}