There are 8 people of different heights, A, B, C, D, ..., arranged in a horizontal row. How many ways are there to make any shorter person not sandwiched between two taller people?
有A，B，C，D，…等身高不等的8人排成一横列，欲使任一较矮者不夹排在二较高者之间之排法共有几种？
<gadget id="calculator">2 * 2 * 2 * 2 * 2 * 2 * 2 * 1</gadget>
<output>128</output>

<result>128</result>