It can be solved by using the idea of mapping. We can refer to the topic of the 2000 Korea Mathematical Olympics and draw the following conclusions:

If the number of committee members is m, any n committee members can't be opened, and any n+ 1 committee members can be opened, then the number of locks is C(m, n) (indicating the number of combinations from n to m).

For this problem, C( 1 1, 5)=396 is the demand.