Binary Query Budget for Composite State 1

A hidden system state is determined by a venue among 7 choices, a regime among 4 choices, and a throttle flag among 2 choices. Each yes/no query can return one bit. What is the minimum number of yes/no queries needed to guarantee identifying the full hidden state?