{"raw_statement":[{"iden":"problem statement","content":"Snuke has decided to play with a six-sided die. Each of its six sides shows an integer $1$ through $6$, and two numbers on opposite sides always add up to $7$.\nSnuke will first put the die on the table with an arbitrary side facing upward, then repeatedly perform the following operation:\n\n*   Operation: Rotate the die $90°$ toward one of the following directions: left, right, front (the die will come closer) and back (the die will go farther). Then, obtain $y$ points where $y$ is the number written in the side facing upward.\n\nFor example, let us consider the situation where the side showing $1$ faces upward, the near side shows $5$ and the right side shows $4$, as illustrated in the figure. If the die is rotated toward the right as shown in the figure, the side showing $3$ will face upward. Besides, the side showing $4$ will face upward if the die is rotated toward the left, the side showing $2$ will face upward if the die is rotated toward the front, and the side showing $5$ will face upward if the die is rotated toward the back.\n\n![image](https://atcoder.jp/img/arc068/864abc2e4a08c26015ffd007a30aab03.png)\n\nFind the minimum number of operation Snuke needs to perform in order to score at least $x$ points in total."},{"iden":"constraints","content":"*   $1 ≦ x ≦ 10^{15}$\n*   $x$ is an integer."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$x$"},{"iden":"sample input 1","content":"7"},{"iden":"sample output 1","content":"2"},{"iden":"sample input 2","content":"149696127901"},{"iden":"sample output 2","content":"27217477801"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}