We show that while the length ω iterated ultrapower by a normal ultrafilter is a Boolean ultrapower by the Boolean algebra of Př́ıkrý forcing, it is consistent that no iteration of length greater than ω (of the same ultrafilter and its images) is a Boolean ultrapower. For longer iterations, where different ultrafilters are used, this is possible, though… (More)