Card-based cryptography realizes secure multiparty computation using physical cards. In 2018, Watanabe et al. proposed a cardbased three-input majority voting protocol using three cards. In a card-based cryptographic protocol with ๐-bit inputs, it is known that a protocol using shuffles requires at least 2๐ cards. In contrast, as Watanabe et al.'s protocol, a protocol using private permutations can be constructed with fewer cards than the lower bounds above. Moreover, an ๐-input protocol using private permutations would not even require ๐ cards in principle since a private permutation depending on an input can represent the input without using additional cards. However, there are only a few protocols with fewer than ๐ cards. Recently, Abe et al. extended Watanabe et al.'s protocol and proposed an ๐-input majority voting protocol with ๐ cards and ๐ + โ๐/2โ + 1 private permutations. This paper proposes an ๐-input majority voting protocol with โ๐/2โ + 1 cards and 2๐ โ 1 private permutations, which is also obtained by extending Watanabe et al.'s protocol. Compared with Abe et al.'s protocol, although the number of private permutations increases by about ๐/2, the number of cards is reduced by about ๐/2. In addition, unlike Abe et al.'s protocol, our protocol includes Watanabe et al.'s protocol as a special case where ๐ = 3.