Record Detail

#	Status	Time Cost	Memory Cost
#1	Accepted	13ms	2.777 MiB
#2	Wrong Answer	13ms	2.828 MiB
#3	Accepted	14ms	2.789 MiB
#4	Accepted	13ms	2.887 MiB
#5	Accepted	13ms	2.789 MiB
#6	Accepted	13ms	2.801 MiB
#7	Accepted	13ms	2.781 MiB
#8	Accepted	13ms	2.777 MiB
#9	Accepted	13ms	2.84 MiB
#10	Accepted	14ms	2.766 MiB
#11	Accepted	13ms	2.785 MiB
#12	Accepted	13ms	2.809 MiB
#13	Wrong Answer	13ms	2.797 MiB
#14	Accepted	13ms	2.785 MiB
#15	Accepted	14ms	2.789 MiB
#16	Accepted	14ms	2.68 MiB
#17	Accepted	13ms	2.695 MiB
#18	Accepted	13ms	2.789 MiB
#19	Accepted	13ms	2.777 MiB
#20	Accepted	14ms	2.82 MiB
#21	Wrong Answer	13ms	2.887 MiB
#22	Wrong Answer	12ms	2.863 MiB
#23	Wrong Answer	13ms	2.738 MiB
#24	Accepted	13ms	2.789 MiB
#25	Accepted	13ms	2.789 MiB
#26	Accepted	13ms	2.887 MiB
#27	Accepted	13ms	2.844 MiB
#28	Accepted	13ms	2.789 MiB
#29	Accepted	13ms	2.711 MiB
#30	Accepted	13ms	2.824 MiB
#31	Accepted	13ms	2.828 MiB
#32	Wrong Answer	13ms	2.75 MiB
#33	Accepted	13ms	2.848 MiB
#34	Accepted	13ms	2.734 MiB
#35	Accepted	13ms	2.82 MiB
#36	Accepted	14ms	2.859 MiB
#37	Wrong Answer	13ms	2.809 MiB
#38	Accepted	13ms	2.707 MiB
#39	Accepted	13ms	2.777 MiB

for i in range(int(input())):
  a,b,c,d=map(int,input().split())
  count=(a*1)+(b*2)+(c*3)+(d*3)
  Brick=int(count/9)
  print(f"Case {i+1}: {Brick}")

Wrong Answer