  We present an algorithm to calculate the result of combinatorial
wall-crossing at every step starting with the column partition of prime size.
This algorithm is confirmed by computer calculations. The output of the
algorithm is consistent with Bezrukavnikov's conjecture in the case of the sign
representation.
