Record Detail

#	Status	Time Cost	Memory Cost
#1	Accepted	13ms	2.785 MiB
#2	Wrong Answer	13ms	2.797 MiB
#3	Accepted	13ms	2.891 MiB
#4	Accepted	13ms	2.855 MiB
#5	Accepted	13ms	2.797 MiB
#6	Accepted	13ms	2.883 MiB
#7	Accepted	13ms	2.777 MiB
#8	Accepted	13ms	2.766 MiB
#9	Accepted	14ms	2.891 MiB
#10	Accepted	13ms	2.801 MiB
#11	Accepted	13ms	2.809 MiB
#12	Accepted	13ms	2.887 MiB
#13	Wrong Answer	13ms	2.887 MiB
#14	Accepted	13ms	2.836 MiB
#15	Accepted	13ms	2.832 MiB
#16	Accepted	13ms	2.895 MiB
#17	Accepted	13ms	2.691 MiB
#18	Accepted	13ms	2.797 MiB
#19	Accepted	13ms	2.738 MiB
#20	Accepted	13ms	2.82 MiB
#21	Wrong Answer	13ms	2.773 MiB
#22	Wrong Answer	13ms	2.836 MiB
#23	Wrong Answer	14ms	2.883 MiB
#24	Accepted	13ms	2.828 MiB
#25	Accepted	13ms	2.793 MiB
#26	Accepted	13ms	2.719 MiB
#27	Accepted	13ms	2.891 MiB
#28	Accepted	14ms	2.691 MiB
#29	Accepted	14ms	2.668 MiB
#30	Accepted	13ms	2.777 MiB
#31	Accepted	13ms	2.777 MiB
#32	Wrong Answer	13ms	2.777 MiB
#33	Accepted	13ms	2.887 MiB
#34	Accepted	13ms	2.82 MiB
#35	Accepted	13ms	2.812 MiB
#36	Accepted	13ms	2.887 MiB
#37	Wrong Answer	13ms	2.715 MiB
#38	Accepted	13ms	2.812 MiB
#39	Accepted	13ms	2.891 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