Im very sick so this is a very bad solve. This solution works by converting the input string from binary to base 6. The solve starts by grabbing X quicksilver based on the value of the input. It then sets one metal be X mod 6, and the other metal be the remainder. To do modulo, my system divides by 6 repeatedly, making a chain of length X mod 6. That chain then rotates Rivari's wheel that many times. For the remainder, I just take the leftover stick and use it to purify a lead. To save sanity, I encode the 8ths place and the 16ths place with salt instead of 6 quicksilver. It's not strictly necessary but I didn't feel like programming the division arm 5 times, nor dealing with the geometry that would imply. I really hope this X mod 6 and remainder method will get used better by someone else because this is really tragic. Thanks for an amazing tournament Haxton, although having no real cost puzzle is definitely the reason I have Pnemonia right now :P