import
java.io.*;
class
GFG
{
static
int
minimize(
int
n)
{
int
optEle = n;
String strEle = Integer.toString(n);
for
(
int
idx =
0
; idx < strEle.length(); idx++)
{
int
temp
= Integer.parseInt(strEle.substring(idx)
+ strEle.substring(
0
, idx));
optEle = Math.min(optEle, temp);
}
return
optEle;
}
static
int
maximize(
int
n)
{
int
optEle = n;
String strEle = Integer.toString(n);
for
(
int
idx =
0
; idx < strEle.length(); idx++)
{
int
temp
= Integer.parseInt(strEle.substring(idx)
+ strEle.substring(
0
, idx));
optEle = Math.max(optEle, temp);
}
return
optEle;
}
static
void
minimumDifference(
int
[] arr)
{
int
caseOne =
0
;
int
minVal =
0
;
int
maxVal =
0
;
for
(
int
i =
0
; i < arr.length; i++)
{
if
(i %
2
==
0
)
minVal += minimize(arr[i]);
else
maxVal += maximize(arr[i]);
}
caseOne = Math.abs(maxVal - minVal);
int
caseTwo =
0
;
minVal =
0
;
maxVal =
0
;
for
(
int
i =
0
; i < arr.length; i++)
{
if
(i %
2
==
0
)
maxVal += maximize(arr[i]);
else
minVal += minimize(arr[i]);
caseTwo = Math.abs(maxVal - minVal);
}
System.out.println(Math.max(caseOne, caseTwo));
}
public
static
void
main(String[] args)
{
int
[] arr = {
332
,
421
,
215
,
584
,
232
};
minimumDifference(arr);
}
}