private static int linearCongruenceStepsNaturalSearch(
            final List<Integer> divisors) {
        int d = divisors.remove(0); // remove 1 and initialize d
        for (int i = 0; i < divisors.size(); ++i) {
            final int di = divisors.get(i);
            if (di > 13)
                break;
            if (di > d)
                d = di;
        }
        return d;
    }