{"problem":{"name":"I hate Factorization","description":{"content":"Give a pair of integers $(A, B)$ such that $A^5-B^5 = X$. It is guaranteed that there exists such a pair for the given integer $X$.","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc166_d"},"statements":[{"statement_type":"Markdown","content":"Give a pair of integers $(A, B)$ such that $A^5-B^5 = X$. It is guaranteed that there exists such a pair for the given integer $X$.\n\n## Constraints\n\n*   $1 \\leq X \\leq 10^9$\n*   $X$ is an integer.\n*   There exists a pair of integers $(A, B)$ satisfying the condition in Problem Statement.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$X$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc166_d","tags":[],"sample_group":[["33","2 -1\n\nFor $A=2$ and $B=-1$, $A^5-B^5 = 33$."],["1","0 -1"]],"created_at":"2026-03-03 11:01:14"}}