An antimagic labeling of a directed graph D with n vertices and m arcs is bijection from the set to integers { 1 , … } such that all oriented vertex sums are pairwise distinct, where an sum labels entering minus leaving it. A has orientation if it admits labeling. Hefetz, Mütze, Schwartz conjectured every connected orientation. In this paper, we show bipartite no degree 0 or 2 minimum at least 33