It is well known that a quantum computer can search more quickly than a classical computer while solving the so-called Grover-searching problem. We present a new searching problem which cannot be classified into Grovers problem and can be solved by using the modified searching iterations with the same efficiency as for Grovers problem.