How many distinct sequences of four letters can be made from the letters in PROBLEM if each letter can be used only once and each sequence must begin with L and not end with P?
<|im_start|>system
You are a helpful assistant.<|im_end|>
<|im_start|>user
How many distinct sequences of four letters can be made from the letters in PROBLEM if each letter can be used only once and each sequence must begin with L and not end with P?
Please reason step by step, and put your final answer within \boxed{{}}.<|im_end|>
<|im_start|>assistant

user
100
How many distinct sequences of four letters can be made from the letters in PROBLEM if each letter can be used only once and each sequence must begin with L and not end with P?
train