We　propose　a　flexible　protocol　for　one-out-of-nquantum　oblivious　transfer　(QOT)　Compared　with　existing　QOT　protocols,　our　protocol　is　more　flexible.　We　demonstrate　that,　by　adjusting　the　value　of　theta　the　flexible　one-out-of-nQOT　is　allowable　where　n　can　be　located　theoretically　on　any　value　the　communicating　parties　wanted.　Meanwhile,　it　also　meets　the　rigorous　security　requirements　of　the　oblivious　transfer　(OT)　definition,　which　ensures　Bob　can　receive　on　average　one　of　n　messages　held　by　Alice,　while　Alice　cannot　know　which　one　Bob　has　received.　Finally,　we　analyze　the　security　of　our　protocol　and　show　that　it　is　not　based　on　quantum　bit　commitment　and　does　not　violate　Lo＇s　no-go　theorem　so　that　its　security　can　be　achieved.