Amelia attempted to solve n algorithmic problems, where n is an odd number. She wrote down one problem per page in her journal and marked the page with when she was unable to solve the problem and with when she was able to solve it. Suppose that we want to find the pattern where she was unable to solve a problem, but was able to solve the subsequent problem. Find an algorithm that always looks at fewer than n pages but is able to correctly find the pattern when it exists