Prove that a simple Random Walk, that moves from any integern to n+1 with probability p and to n-1 with probability q=1-p, with p>=q, hits any positive level N, however large when started at x=-100 in finite time with a positive probability.