Seymour＇s　Second　Neighborhood　Conjecture　(SSNC)　asserts　that　there　always　exists　a　vertex　v　such　that　the　cardinality　of　its　second　out-neighborhood　is　at　least　as　large　as　its　out-neighborhood　in　every　finite　oriented　graph.　For　t　＞=　s　＞=　0,　an　(s,　t)-semi-cycle　is　an　oriented　cycle　obtained　from　a　directed　cycle　of　length　t　by　reversing　exactly　s　continuous　arcs.　In　this　paper,　we　verify　that　any　oriented　graph　without　(2,　8)-semi　-cycle　satisfies　SSNC.　Consequently,　we　prove　that　SSNC　holds　for　every　oriented　graph　whose　underlying　graph　has　no　cycle　of　length　8.　(c)　2023　Elsevier　B.V.　All　rights　reserved.