A cutset is a non-empty finite subset of $\mathbb{Z}^d$ which is both connected and co-connected. A cutset is odd if its vertex boundary lies in the odd bipartition class of $\mathbb{Z}^d$. Peled suggested that the number of odd cutsets which contain the origin and have $n$ boundary edges may be of order $e^{Θ(n/d)}$ as $d \to \infty$, much smaller than the number of general cutsets, which was shown by Lebowitz and Mazel to be of order $d^{Θ(n/d)}$. In this paper, we verify this by showing that the number of such odd cutsets is $(2+o(1))^{n/2d}$.