Construct an iterative algorithm which moves all odd numbers from a queue of integers called BUFFIN into another queue called BUFFOUT. Use an intermediate stack called HAY such that the resultant numbers in BUFFOUT are, with respect to their original sequence in BUFFIN, in reverse order. Both BUFFOUT and HAY are initially empty.