Just picked up some matte clay , almost felt bad buying it at that steep of a discount <| sep |> Eh , Aldi is OKAY . I can get some stuff , but not everything is comparable and it can really be hit or miss . <| sep |> Green Day 1039 Slappy hours , Kerplunk ! and Bsides and rarities . Blink 182 Enema OTS , Take of your pants and jacket , selftitledTP Well they only really have 3 albums except for the first which was never fully published so all of them . Regional at Best , Vessel , and Blurryface . <| sep |> Remember everyone that the fossil fuels industry gets plenty of subsidies as well . <| sep |> I think this would be the easiest approach . m intinput ' Unesi prvi broj ' n intinput ' Unesi drugi broj ' for i in rangeminm , n , 0 , 1 if m % i 0 and n % i 0 printi breakThe third argument to the range function here is actually the step size you want to make each iteration . We ' ll use 1 to loop backwards , which ' ll conveniently place the greatest common divisor first . What we ' re doing here is starting from the smaller of the 2 numbers since the greatest common divisor can ' t be larger than that , and we ' re checking all numbers until 1 we had to put zero as the second argument to make that happen , because the zero won ' t be included . As soon as it finds the greatest common divisor , it ' ll print it and break the loop .