yeah you might be strange but are you strange enough to design a binary adder with logic gates on paper and then test it by making it in your graphing calculator just because you’re bored??
1 -> A
0 -> B
1 -> C
{ (A and B) or (A and C) or (B and C), ((A and B) and C) or ((A xor B) xor c) }
output: { 1 0 }
closest I did was https://esolangs.org/wiki/Talk:3_Bits,_3_Bytes#Longest_running_program