Karan has N items in his store (numbered 1 to N); And in i Each valid (1

Extracted text: Karan has N items in his store (numbered 1 to N); And in i Each valid (1 <=><= n).="" the="" weight="" of="" the="" i="" th="" object="" is="" wi.="" as="" chef="" is="" very="" sensitive="" to="" nature.="" karan="" wants="" to="" arrange="" all="" the="" weights="" on="" one="" side="" and="" the="" weights="" on="" the="" other="" side.="" karan="" can="" arrange="" two="" dependent="" items="" with="" the="" help="" of="" an="" exchange="" during="" a="" single="" operation.="" karan="" needs="" the="" minimum="" working="" number="" required="" to="" set="" the="" all-equal="" weight="" item="" on="" one="" side="" and="" the="" all-odd="" weights="" on="" the="" other.="" karan="" cannot="" solve="" this="" problem="" so="" he="" asks="" you="" to="" solve="" it.="" help="" chef="" solve="" this="" problem="" using="" java="" programming="" language.="" input="" 1="" 3="" 187="" output="">