{"push_id":1292601873,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"7577d4d60b26138e63377552605f5868ebc2603b","before":"a9d67c228181583e4c9a699202f6da8d63592e82","commits":[{"sha":"7577d4d60b26138e63377552605f5868ebc2603b","author":{"name":"kaanand54","email":"7e6e4029d2b9816cf28898dffb21d040574f396d@users.noreply.github.com"},"message":"GCD of a larger set of numbers\n\nUsed Euclid's algorithm","distinct":true,"url":"https://api.github.com/repos/kaanand54/program/commits/7577d4d60b26138e63377552605f5868ebc2603b"}]}
{"actor":{"display_login":"kaanand54"}}