We give a polynomial-time algorithm to test whether a graph contains an induced cycle with length more than three and odd.