The strength of Jullien's indecomposability Theorem

Jullien's indecomposability theorem states that if a scattered countable linear order is indecomposable, then it is either indecomposable to the left, or indecomposable to the right. The theorem was shown by Montalban to be a theorem of hyperarithmetic analysis. We identify the strength of the theorem relative to standard reverse mathematics markers. We show that it lies strictly between weak choice and comprehension.