eolymp
bolt
Try our new interface for solving problems
Problems

Once - peas, two - peas...

Once - peas, two - peas...

Winter is coming, and Homa with Gopher decided to stock up peas. All day they ran into the barn and dragged several pods: Homa, four, and two Gopher. By the evening they counted all the pods that they are dragged, and thinking, as now, this pea share. Homa stated that if he just pulled over twice more than the Gopher, then peas, he should get in twice. Gopher at this reasonably argued that, firstly, the speed at Homa noticeably smaller than gophers, and, secondly, who knows, maybe Homa only once or twice ran, and the rest of the lazy ... Help your friends a little understanding of this complex situation. Identify all possible options on how many pods brought a Gopher, and how many Homa. \InputFile The first line of a natural even number of \textbf{M} - the number of stolen pods, \textbf{2} ≤ \textbf{M} ≤ \textbf{1000}. \textbf{Output} All possible combinations of the number of peppers, brought Gopher and Homa on one combination per line. Each combination represents two nonnegative integers through the gap: the first number - the number of pods, of a Gopher, the second - brought Homa. The combination of the first descending order by number.
Time limit 1 second
Memory limit 64 MiB
Input example #1
6
Output example #1
6 0
2 4