This is joint work with Richard A. Shore from a few years ago. We find the exact amount of determinacy that can be proved within second order arithmetics. For that, we need to dig deep into n-admissible ordinals and other techniques from higher computability theory. I will show how n-admissible ordinals come into play in the proof.