In this paper, we show that given a binary n-cube with f(e) less than or equal to n - 4 faulty edges and f(v) less than or equal to n - 1 faulty vertices such that f(e) + f(v) less than or equal to n - 1, a ring of length at least 2(n) - 2f(v) can be obtained. The best known results can tolerate only faulty edges or only faulty vertices.