import
java.io.*;
class
GFG
{
static
void
find(String string1, String string2)
{
int
M = string1.length();
int
N = string2.length();
char
c1 = string1.charAt(M -
1
);
char
c2 = string2.charAt(N -
1
);
int
[]f1 =
new
int
[
26
];
int
[]f2 =
new
int
[
26
];
for
(
int
i =
0
; i < M -
1
; i++)
f1[string1.charAt(i) -
'a'
]++;
for
(
int
i =
0
; i < N -
1
; i++)
f2[string2.charAt(i) -
'a'
]++;
int
ma1 =
0
, mi1 = M, ma2 =
0
, mi2 = N;
for
(
int
i =
0
; i <
26
; i++) {
ma1 = Math.max(ma1, f1[i]);
if
(f1[i] >
0
)
mi1 = Math.min(mi1, f1[i]);
ma2 = Math.max(ma2, f2[i]);
if
(f2[i] >
0
)
mi2 = Math.min(mi2, f2[i]);
}
System.out.print(ma1 - mi1 +
" "
);
if
(c1 ==
's'
)
System.out.print(
"South "
);
else
System.out.print(
"North "
);
System.out.print(ma2 - mi2);
if
(c2 ==
'e'
)
System.out.print(
" East "
);
else
System.out.print(
" West "
);
}
public
static
void
main (String[] args) {
String string1 =
"babbeddcs"
;
String string2 =
"aeeaecacw"
;
find(string1, string2);
}
}