payload: {"push_id":4110354574,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"18a6dd15937c87d541e6d7cdafc5a53824acc6dc","before":"f6b6e927dd8d7a5bb17f17bdbe75774140c92f0f","commits":[{"sha":"18a6dd15937c87d541e6d7cdafc5a53824acc6dc","author":{"name":"ha816","email":"6c2a59ce6c717099d054bc38ec9fbda5eb3021c7@naver.com"},"message":"algorithms/동적계획법 알고리즘(2).md updated from https://stackedit.io/","distinct":true,"url":"https://api.github.com/repos/ha816/study/commits/18a6dd15937c87d541e6d7cdafc5a53824acc6dc"}]}
other: {"actor":{"display_login":"ha816"}}