Problem:


Score : 300 points

Problem Statement

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.

Snuke will first put the die on the table with an arbitrary side facing upward, then repeatedly perform the following operation:

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.

For 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.

Find the minimum number of operation Snuke needs to perform in order to score at least x points in total.

Constraints

1 ≦ x ≦ 10^{15}

x is an integer.

Input

The input is given from Standard Input in the following format:

x

Output

Print the answer.

Sample Input 1

7

Sample Output 1

2

Sample Input 2

149696127901

Sample Output 2

27217477801



Sample input:
7


Sample output:
2

Submission status: Wrong Answer

Solution code:
import math
x = int(input())

count = 0
buff = x

# print(int(buff//5.5+1))

count = buff // 11
_buff = buff % 11

# print('count')
# print(count)
# print(_buff)
print(count*2+1)

Submission status: Wrong Answer

Solution code:
import math
x = int(input())

count = 0
buff = x

print(int(buff//5.5+1))

"""
100 -> 19
"""

Submission status: Wrong Answer

Solution code:
n = int(input())

a = n // 11 *2
b = n % 11
c = 0
if b > 0:
	c = 1
elif b >= 7:
	c = 2
print(a+c)

Submission status: Wrong Answer

Solution code:

n = int(input())

a = n // 11 *2
b = n % 11
c = 1
if b >= 7:
	c = 2
print(a+c)

Submission status: Wrong Answer

Solution code:

n = int(input())

a = n // 11 *2
b = n % 11
c = 1
if b >= 6:
	c = 2
print(a+c)

Submission status: Wrong Answer

Solution code:
n = int(input())

a = n // 11
b = n % 11
c = 1
if b >= 6:
	c = 2
print(a+c)

Submission status: Wrong Answer

Solution code:
x = int(input())
tmp = x // 11
ans = int(2*tmp)
if x % 11 <= 6:
  ans += 1
else:
  ans += 2
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
q, mod = divmod(x, 11)
if (mod <= 6):
    print(q * 2 + 1)
else:
    print(q * 2 + 2)

Submission status: Wrong Answer

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7

def LI(): return list(map(int,input().split()))
def I(): return int(input())
def LS(): return input().split()
def S(): return input()

def main():
  n=I()
  a=n/5.5
  return -int(-a//1)

print(main())

Submission status: Wrong Answer

Solution code:
x = int(input())
ans = (x // 11) * 2
n = x % 11
if n > 6:
	print(ans + 2)
else:
	print(ans + 1)

Submission status: Wrong Answer

Solution code:
x = int(input())
y = x // 11
z = x % 11
if z <= 6:
  print(y * 2 + 1)
if z > 6:
  print(y * 2 + 2)

Submission status: Wrong Answer

Solution code:
x = int(input())
if x <= 6:
    print(1)
elif x % 11 == 0 or x % 17 == 0:
    print(x*2//11)
else:
    print(x*2//11+1)

Submission status: Wrong Answer

Solution code:
x = int(input())
if x <= 6:
    print(1)
elif x % 11 == 0:
    print(x*2//11)
else:
    print(x*2//11+1)

Submission status: Wrong Answer

Solution code:
x = int(input())
if x % 11 == 0:
    print(x//11*2)
else:
    print(x//11*2+1)

Submission status: Wrong Answer

Solution code:
x = int(input())
if x % 11 == 0:
    print(x*2//11)
else:
    print(x*2//11+1)

Submission status: Wrong Answer

Solution code:
x = int(input())
print(x*2//11+1)

Submission status: Wrong Answer

Solution code:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

x = int(input())

cnt = (x // 11)*2

if x % 11 == 0:
    ans = cnt
elif x % 11 > 5:
    ans = cnt + 2
else:
    ans = cnt + 1

print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
ans=0

ans+=(x//11)*2
x%=11

if x>5:
    print(ans+2)
elif x>0:
    print(ans+1)
else:
    print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

num = (x // 11) * 2
amari = x % 11

if amari == 0:
    print(num)
elif amari <= 5:
    print(num + 1)
else:
    print(num + 2)

Submission status: Wrong Answer

Solution code:
x = int(input())

num = (x // 11) * 2
amari = x % 11

if num == 0:
    print(num)
elif amari <= 5:
    print(num + 1)
else:
    print(num + 2)

Submission status: Wrong Answer

Solution code:
x = int(input())

num = (x // 11) * 2
amari = x % 11

if amari <= 5:
    print(num + 1)
else:
    print(num + 2)

Submission status: Wrong Answer

Solution code:
n=int(input())
ans=2*n//11
n=n%11
if n==0:
  ans+=0
elif n<=6:
  ans+=1
else:
  ans+=2
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
ans=2*n//11
n-=11*(n//11)
if n==0:
  ans+=0
elif n<=6:
  ans+=1
else:
  ans+=2
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
t = 2 * (x // 11)
x = x % 11
if x > 5:
    print(t + 2)
elif x > 0:
    print(t + 1)
else:
    print(t)

Submission status: Wrong Answer

Solution code:
x = int(input())
t = 2 * (x // 11)
x = x % 11
print(t + x // 5 + 1)

Submission status: Wrong Answer

Solution code:
x = int(input()) - 1
t = 2 * (x // 11)
x = x % 11
print(t + x // 5 + 1)

Submission status: Wrong Answer

Solution code:
from math import ceil
x=int(input())
ans=ceil(x/11)*2
print(ans if x%11==0 else ans-1)

Submission status: Wrong Answer

Solution code:
x=int(input())

if x<7:
    print(1)
elif 7<=x<=11:
    print(2)
elif x%11==0 or x%11>6:
    print((x//11)*2)
else:
    print((x//11)*2+1)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-

def solve(x):
    if(x<=6):
        print(1)
    elif(x<=11):
        print(2)
    else:
        if(x%11<=6):
            print(1+(x//11)*2)
        else:
            print(2+(x//11)*2)
    
if __name__ == '__main__':
    x = int(input())

    solve(x)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-

def solve(x):
    if(x<=6):
        print(1)
    elif(x<=11):
        print(2)
    else:
        if(x//11):
            print(1+(x//11)*2)
        else:
            print((x//11)*2)
    
if __name__ == '__main__':
    x = int(input())

    solve(x)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-

def solve(x):
    if(x<=6):
        print(1)
    elif(x<=11):
        print(2)
    else:
        if(x//11):
            print(1+(x//11)*2)
        else:
            print((x//11))
    
if __name__ == '__main__':
    x = int(input())

    solve(x)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-

def solve(x):
    if(x<=6):
        print(1)
    elif(x<=11):
        print(2)
    elif(x//11):
        print(1+(x//11)*2)
    else:
        print((x//11))
    
if __name__ == '__main__':
    x = int(input())

    solve(x)

Submission status: Wrong Answer

Solution code:
x=int(input())
a=x//11
if x%11<=6:
    print(2*a+1)
else:
    print(2*a+2)

Submission status: Wrong Answer

Solution code:
x=int(input())
a=x//11
if x%11<7:
    print(2*a+1)
else:
    print(2*a+2)

Submission status: Wrong Answer

Solution code:
x=int(input())
a=x//11
if x%11<6:
    print(2*a+1)
else:
    print(2*a+2)

Submission status: Wrong Answer

Solution code:
s = input()

ans = ''
idx = -1
for i, c in enumerate(s):
    if c == 'A' and idx == -1:
        idx = i
        break
for i, c in enumerate(reversed(s)):
    if c == 'Z':
        ans = s[idx:len(s)-i]
        break
print(len(ans))

Submission status: Wrong Answer

Solution code:


def read_input():
    x = int(input())
    return x


def submit():
    x = read_input()

    a = x // 11
    b = x % 11

    c = 2 * a

    if b <= 6:
        c += 1
    else:
        c += 2

    print(c)


if __name__ == '__main__':
    submit()

Submission status: Wrong Answer

Solution code:
x = int(input())

ans = 0
if x // 11:
    ans += x // 11 * 2
    pt = x // 11 * 11
    x -= pt

if x <= 6:
    print(ans + 1)
else:
    print(ans + 2)

Submission status: Wrong Answer

Solution code:
x = int(input())

tim = x * 2 / 11
tim2 = x * 2 // 11
if tim == tim2:
    pass
else:
    tim2 += 1

print(tim2)

Submission status: Wrong Answer

Solution code:
x = int(input())
print(1 if x == 6 else int(x//5.5)+1)

Submission status: Wrong Answer

Solution code:
import math, string, itertools, fractions, heapq, collections, re,  array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def _I(): return int(sys.stdin.readline())
def _F(): return float(sys.stdin.readline())
def pf(s): return print(s, flush=True)

x=_I()
#6,5の繰り返し
ans =(x//11)*2
rest=x%11
if rest <=6:
	ans +=1
else:
	ans+=2
print(ans)

Submission status: Wrong Answer

Solution code:
import math, string, itertools, fractions, heapq, collections, re,  array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def _I(): return int(sys.stdin.readline())
def _F(): return float(sys.stdin.readline())
def pf(s): return print(s, flush=True)

x=_I()
#6,5の繰り返し
ans =x//11*2
rest=x%11
if rest <=6:
	ans +=1
else:
	ans+=2
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
cnt=0
x=n//11
a=n%11
cnt+=2*x
if a<=6:
    cnt+=1
else:
    cnt+=2
print(cnt)

Submission status: Wrong Answer

Solution code:
import math
# 1 -> 5 -> 6

x = int(input())

if x <= 5:
    print(1)

elif x <= 11:
    print(2)

else:
    x -= 11
    ans = 2

    temp = x % 11

    if temp == 0:
        pass
    elif temp <= 5:
        ans += 1
    elif temp >= 6:
        ans += 2

    print(ans + int(math.floor(x / 11)) * 2)

Submission status: Wrong Answer

Solution code:
# vim: set fileencoding=utf-8:

def main():
    x = input()
    if x < 7:
        ans = 1
    else:
        ans = (x /11)*2
        if 0< x%11 < 7:
            ans = ans + 1
        else:
            ans = ans + 2
                
    print(ans)

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
x = int(input())

div, mod = divmod(x, 11)

div = div*2
if mod <= 6:
    div = div + 1
elif mod == 7:
    div = div + 3
else:
    div = div + 2

print(div)

Submission status: Wrong Answer

Solution code:
x = int(input())

div, mod = divmod(x, 11)

div = div*2
if mod <= 6:
    div = div + 1
else:
    div = div + 2

print(div)

Submission status: Wrong Answer

Solution code:
x = int(input())

div, mod = divmod(x, 11)

div = div*2
if mod <= 5:
    div = div + 1
else:
    div = div + 2

print(div)

Submission status: Wrong Answer

Solution code:
import math
# 1 -> 5 -> 6

x = int(input())

if x <= 5:
    print(1)

elif x <= 11:
    print(2)

else:
    x -= 11
    ans = 2

    temp = x % 11

    if temp == 0:
        print(ans + int(math.floor(x / 11)) * 2)
    else:
        if temp <= 5:
            ans += 1
        else:
            ans += 2
        print(ans + int(math.floor(x / 11)) * 2)

Submission status: Wrong Answer

Solution code:
import math
# 1 -> 5 -> 6

x = int(input())

if x <= 5:
    print(1)

elif x <= 11:
    print(2)

else:
    x -= 11
    ans = 2

    temp = x % 11

    if temp == 0:
        print(ans + int(math.floor(x / 11)) * 2)
    else:
        if temp <= 6:
            ans += 1
        else:
            ans += 2
        print(ans + int(math.floor(x / 11)) * 2)

Submission status: Wrong Answer

Solution code:
x = int(input())

if x <= 5:
    print(1)

elif x <= 11:
    print(2)

else:
    x -= 11
    ans = 2

    temp = x % 11

    if temp == 0:
        print(ans + int(x / 11) * 2)
    else:
        if temp <= 6:
            ans += 1
        else:
            ans += 2
        print(ans + int(x / 11) * 2)

Submission status: Wrong Answer

Solution code:
x = int(input())
import math
print(math.floor(x /  5.5) + 1)

Submission status: Wrong Answer

Solution code:
x = int(input())
import math
print(math.ceil(x /  5.5))

Submission status: Wrong Answer

Solution code:
x = int(input())
import math
math.ceil(x /  5.5)

Submission status: Wrong Answer

Solution code:
n=int(input())
x=int(n/11*2)
if n == 6:
  print(1)
elif n % 11 == 0:
  print(x)
else:
  print(x+1)

Submission status: Wrong Answer

Solution code:
x = int(input())
if x < 7:
    print(1)
elif 6 < x < 12:
    print(2)
else:
    if x%11 < 7:
        print((x//11)*2 + 1)
    else:
        print((x//11)*2 + 2)

Submission status: Wrong Answer

Solution code:
x = int(input())
if x < 7:
    print(1)
elif 6 < x < 12:
    print(2)
else:
    print((x//11)*2 + x%11)

Submission status: Wrong Answer

Solution code:
x = int(input())
print(int(x//5.5+x%11) if x > 11 else (1 if x <= 6 else 2))

Submission status: Wrong Answer

Solution code:
n=int(input());print(n//11*2+(((n%11)-1)//5+1))

Submission status: Wrong Answer

Solution code:
n=int(input());m=n//11;print(m*2+(((n-m)-1)//5+1))

Submission status: Wrong Answer

Solution code:
n=int(input());m=n//11;print(m*2+((m-1)//5+1))

Submission status: Wrong Answer

Solution code:
print((int(input())*2-1)//11+1)

Submission status: Wrong Answer

Solution code:
def x_yet_another_die_game(x: int)->int:
    n = x // 11
    if x == n * 11:
        return 2 * n
    if x < n * 11 + 6:
        return 2 * n + 1
    return 2 * n + 2


if __name__ == "__main__":
    x = int(input())
    ans = x_yet_another_die_game(x)
    print(ans)

Submission status: Wrong Answer

Solution code:
def x_yet_another_die_game(x: int)->int:
    n = x // 11
    if x == n * 11:
        return 2 * n
    if x < n * 11 + 5:
        return 2 * n + 1
    return 2 * n + 2


if __name__ == "__main__":
    x = int(input())
    ans = x_yet_another_die_game(x)
    print(ans)

Submission status: Wrong Answer

Solution code:
def x_yet_another_die_game(x: int)->int:
    n = x // 11
    if x == n * 11:
        return n
    if x < n * 11 + 5:
        return n + 1
    return n + 2


if __name__ == "__main__":
    x = int(input())
    ans = x_yet_another_die_game(x)
    print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

if x % 11 > 6:
    print((x//11 + 1) * 2)
else:
    print((x//11 + 1) * 2 - 1)

Submission status: Wrong Answer

Solution code:
x = int(input())

if x % 11 > 5:
    print((x//11 + 1) * 2)
else:
    print((x//11 + 1) * 2 - 1)

Submission status: Wrong Answer

Solution code:
x = int(input())

if x % 11 > 5:
    print(x//11 * 2)
else:
    print(x//11 * 2 + 1)

Submission status: Wrong Answer

Solution code:
x=int(input())
ans=(x//11)*2
if x%11<=6:
  ans+=1
else:
  ans+=2
print(ans)

Submission status: Wrong Answer

Solution code:
x=int(input())
ans=x//11
if x%11<=6:
  ans+=1
else:
  ans+=2
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
half, x = divmod(x,11)
if x == 0:
    print(half*2)
elif x <= 5:
    print(half*2 + 1)
else :
    print(half*2 + 2)

Submission status: Wrong Answer

Solution code:
x = int(input())
count = (x // 11) * 2
x %= 11

if x <= 6:
    print(count+1)
else:
    print(count+2)

Submission status: Wrong Answer

Solution code:
n = int(input())
if(n == 1) : print(0)
elif(n%11 == 0) : print(2*n//11)
else : print(2*n//11+1)

Submission status: Wrong Answer

Solution code:
n = int(input())
if(n == 1) : print(0)
else : print(2*n//11+1)

Submission status: Wrong Answer

Solution code:
x=int(input())

ans=0
a=x//11
b=x-a*11
if b<=6:
  ans=a*2+1
else:
  ans=a*2+2
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
y = x // 11
z = x % 11
if z <= 6:
    print(2 * y + 1)
else:
    print(2 * y + 2)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import math

x = int(input())

move = 0

if x < 5:
    move = 1
else:
    move = math.ceil(x / 5.5)

print(move)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import math

x = int(input())

move = 0

if x < 5:
    move = 1
else:
    move = math.floor(x / 5.5) + 1

print(move)

Submission status: Wrong Answer

Solution code:
x=int(input())

if 9>=x%11>6:
    print(2*(x//11)+2)
elif 0<x%11<=6:
    print(2*(x//11)+1)
else:
    print(2*(x//11))

Submission status: Wrong Answer

Solution code:
x=int(input())

if x%11>6:
    print(2*(x//11)+2)
elif 0<x%11<=6:
    print(2*(x//11)+1)
else:
    print(x//11)

Submission status: Wrong Answer

Solution code:
x = int(input())
print( (x // 11)*2 + (1 if x%11<7 else 2))

Submission status: Wrong Answer

Solution code:
x = int(input())
num = x // 11
if x % 11 == 0:
    print(2*num)
elif x % 11 < 6:
    print(2*num+1)
else:
    print(2*num+2)

Submission status: Wrong Answer

Solution code:
def main():
    x = int(input())
    ans = x//11 * 2 + 1
    if x % 11 >= 7:
        ans += 1
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
x = int(input())
if x % 11 == 0:
    print(x//11)
else:
    print((x//11)*2+2 if x % 11 >= 7 else (x//11)*2+1)

Submission status: Wrong Answer

Solution code:
x = int(input())
print((x//11)*2+2 if x % 11 >= 7 else (x//11)*2+1)

Submission status: Wrong Answer

Solution code:
x = int(input())
print((x//11)*2+2 if x % 11 >= 6 else (x//11)*2+1)

Submission status: Wrong Answer

Solution code:
n=int(input())
x=int(n/11*2)
if n % 11 == 0:
  print(x)
else:
  print(x+1)

Submission status: Wrong Answer

Solution code:
print(int((int(input())/11*2+1)//1))

Submission status: Wrong Answer

Solution code:
import math

temp = int(input())/5.5
syousuu = temp - math.floor(temp)
if syousuu < 0.1:
    print(-1 + math.ceil(temp))
else:
    print(math.ceil(temp))

Submission status: Wrong Answer

Solution code:
x = int(input())

if x % 11 <= 6:
    print(x // 11 * 2+1)
else:
    print(x // 11 * 2 + 2)

Submission status: Wrong Answer

Solution code:
x = int(input())
if x%11 == 0:
    print(2//11*2)
elif x%11 <= 6:
    print(x//11*2 + 1)
else:
    print(x//11*2 + 2)

Submission status: Wrong Answer

Solution code:
x = int(input())
s = x // 11
t = x % 11
if t == 0:
    print(2 * s)
elif t < 6:
    print(2 * s + 1)
else:
    print(2 * s + 2)

Submission status: Wrong Answer

Solution code:
n = int(input())

a = int(n / 11)

if(n <= 6):
    print(1)
elif(n <= 11):
    print(2)
elif(n%11 == 0):
    print(a*2)
else:
    print(a*2+1)

Submission status: Wrong Answer

Solution code:
n = int(input())

a = (n//11) * 2
b = n % 11
if b == 0:
    print(a)
elif b <= 5:
    print(a+1)
else:
    print(a+2)

Submission status: Wrong Answer

Solution code:
n = int(input())

a = (n//11) * 2
b = n % 11
if b < 5:
    print(a+1)
else:
    print(a+2)

Submission status: Wrong Answer

Solution code:
n = int(input())

a = (n//11) * 2
b = n % 11
if b <= 5:
    print(a+1)
else:
    print(a+2)

Submission status: Wrong Answer

Solution code:
n = int(input())

a = n//11 * 2
b = n%11
if n <= 5:
    print(a+1)
else:
    print(a+2)

Submission status: Wrong Answer

Solution code:
x=int(input())
a,b=divmod(x,11)
print(2*a+(b+4)//5)

Submission status: Wrong Answer

Solution code:
x=int(input())-1
if x==0:
    print(0)
    exit()
print((x*2//11)+1)

Submission status: Wrong Answer

Solution code:
x = int(input())
count = 0
q, mod = divmod(x, 11)
count += q*2
if(mod <= 6):
    count += 1
else:
    count += 2
print(count)

Submission status: Wrong Answer

Solution code:
x = int(input())
count = 0
q, mod = divmod(x, 11)
count += q*2
if(mod < 6):
    count += 1
else:
    count += 2
print(count)

Submission status: Wrong Answer

Solution code:
x = int(input())
count = 0
q, x = divmod(x, 11)
count += q*2
if(x < 7):
    count += 1
else:
    count += 2
print(count)

Submission status: Wrong Answer

Solution code:
x = int(input())

if x <= 6:
    ans = 1
elif x <= 11:
    ans = 2
else:
    ans = x // 11 * 2
    if x % 11 <= 6:
        ans += 1
    else:
        ans += 2

print(ans)

Submission status: Wrong Answer

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
mod = 1000000007

#A

#B

#C
x = I()
ans = 2*(x//11)+1
x %= 11
if x > 6:
    ans += 1
print(ans)
#D

#E

#F

#G

#H

#I

#J

#K

#L

#M

#N

#O

#P

#Q

#R

#S

#T

Submission status: Wrong Answer

Solution code:
a = int(input())
 
ans = (a//11)*2
nokori = a%11
if nokori==0:
  print(ans)
elif 0<nokori and nokori<=5:
  print(ans+1)
else:
  print(ans+2)

Submission status: Wrong Answer

Solution code:
a = int(input())

ans = (a//11 )*2
if a%11==0:
  print(ans)
elif 0<a%11<=5:
  print(ans+1)
else:
  print(ans+2)

Submission status: Wrong Answer

Solution code:
x = int(input())
cnt = (x//11)*2
k = x%11
if k>6:
    cnt += 2
else:
    cnt += 1
print(cnt)

Submission status: Wrong Answer

Solution code:
x = int(input())
cnt = (x//11)*2
k = x%11
if k>=6:
    cnt += 2
else:
    cnt += 1
print(cnt)

Submission status: Wrong Answer

Solution code:
x = int(input())

a = x // 11
b = 0
if x == 11*a:
    print(2*a)
elif x - 11*a <= 5:
    print(2*a + 1)
else:
    print(2*a + 2)

Submission status: Wrong Answer

Solution code:
n=int(input())
if n%11>6:
  print(n//11*2+1)
else:
  print(n//11*2)

Submission status: Wrong Answer

Solution code:
def fun():
     print('ac')
     print('AC')
     print('ACAC')
     print('ac')
     print('aacc')
n=eval(input())
if n<=6:
     print(1)
elif n<=11:
     print(2)
elif n<=17:
     print(3)
else:
     k=n//11
     if k==0:
          print(2*k)
     else:
          if 11*k+6>=n:
               print(2*k+1)
          else:
               print(2*k+2)

Submission status: Wrong Answer

Solution code:
# https://qiita.com/_-_-_-_-_/items/34f933adc7be875e61d0
# abcde	s=input()	s='abcde'
# abcde	s=list(input())	s=['a', 'b', 'c', 'd', 'e']
# 5(1つだけ)	a=int(input())	a=5
# 1 2	| x,y = map(int,input().split())   |	x=1,y=2
# 1 2 3 4 5 ... n 　	li = input().split()	li=['1','2','3',...,'n']
# 1 2 3 4 5 ... n 　	li = list(map(int,input().split()))	li=[1,2,3,4,5,...,n]
# FFFTFTTFF 　	li = input().split('T')	li=['FFF', 'F', '', 'FF']

# INPUT
# 3
# hoge
# foo
# bar
# ANSWER
# n=int(input())
# string_list=[input() for i in range(n)]


from collections import defaultdict, Counter
import math
from bisect import bisect_left, bisect_right
import numpy as np

#### START
x = int(input())

point = 0
cnt = 0
cnt += (x//11)*2
if x%11>=6:
    cnt+=2
elif x%11>0:
    cnt+=1

print(cnt)

Submission status: Wrong Answer

Solution code:
i=int(input())
ans=i//11*2
if i%11<=6:
  ans+=1
else:
  ans+=2
print(ans)

Submission status: Wrong Answer

Solution code:
i=int(input())
ans=i//11*2
if i<=6:
  ans+=1
else:
  ans+=2
print(ans)

Submission status: Wrong Answer

Solution code:
i=int(input())
ans=(i//11)*2
i=i%11
if i<7:
  ans+=1
elif 7<=i<=9:
  ans+=2
else:
  ans+=3
print(ans)

Submission status: Wrong Answer

Solution code:
i=int(input())
ans=(i//11)*2
i=i%11
if i<7:
  ans+=1
else:
  ans+=2
print(ans)

Submission status: Wrong Answer

Solution code:
i=int(input())
ans=(i//11)*2
i=i%11
if i<7:
  ans+=1
elif i<12:
  ans+=2
else:
  ans+=3
print(ans)

Submission status: Wrong Answer

Solution code:
i=int(input())
ans=i//15*3
i=i%15
if i<7:
  ans+=1
elif i<12:
  ans+=2
else:
  ans+=3
print(ans)

Submission status: Wrong Answer

Solution code:
import math
x=int(input())
if x<=6:
  print(1)
else:
  if x%2:
    print(math.ceil(x/11*2))
  else:
    print(math.floor(x/11*2))

Submission status: Wrong Answer

Solution code:
import math
x=int(input())
if x<=6:
  print(1)
else:
  print(math.ceil(x/11*2))

Submission status: Wrong Answer

Solution code:
import math
x=int(input())
print(math.ceil(x/11*2))

Submission status: Wrong Answer

Solution code:
x=int(input())

r,m=divmod(x,11)

print(r*2+-(-m//5))

Submission status: Wrong Answer

Solution code:
x = int(input())
print(x//11*2+(x % 11+4)//5)

Submission status: Wrong Answer

Solution code:
n = int(input())
x = n // 11
if n % 11 <= 6:
    print(x * 2 + 1)
else:
    print(x * 2 + 2)

Submission status: Wrong Answer

Solution code:
n = int(input())
x = int(n // 11)
if n - (x * 11) <= 6:
    print(x * 2 + 1)
else:
    print(x * 2 + 2)

Submission status: Wrong Answer

Solution code:
n = int(input())
x = int(n // 5.5)
if n - (x * 5.5) <= 6:
    print(x + 1)
else:
    print(x + 2)

Submission status: Wrong Answer

Solution code:
n = int(input())
x = int(n // 5.5)
if n - (x * 5.5) < 6:
    print(x + 1)
else:
    print(x + 2)

Submission status: Wrong Answer

Solution code:
n = int(input())
print(int(n // 5.5 + 1))

Submission status: Wrong Answer

Solution code:
x = int(input())

ans = 0
ans = int(x/11) * 2
x %= 11
if int(x) > 6:
    ans += 2
else:
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
quotients = x // 11
rem = x % 11
ans = quotients * 2
if rem > 0:
    if quotients % 2 == 0:
        if rem < 5:
            ans += 1
        else:
            ans += 2
    else:
        if rem < 6:
            ans += 1
        else:
            ans += 2
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
quotients = x // 11
rem = x % 11
ans = quotients * 2
if rem > 0:
    if quotients % 2 == 0:
        if rem < 6:
            ans += 1
        else:
            ans += 2
    else:
        if rem < 5:
            ans += 1
        else:
            ans += 2
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
quotients = x // 11
rem = x % 11
ans = quotients * 2
if quotients % 2 == 0:
    if rem < 6 and rem > 0:
        ans += 1
    else:
        ans += 2
else:
    if rem < 5 and rem > 0:
        ans += 1
    else:
        ans += 2
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
quotients = x // 11
rem = x % 11
ans = quotients * 2
if quotients % 2 == 0:
    if rem < 5:
        ans += 1
    else:
        ans += 2
else:
    if rem < 6:
        ans += 1
    else:
        ans += 2
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
quotients = x // 11
rem = x % 11
ans = quotients * 2
if quotients % 2 == 0:
    if rem < 6:
        ans += 1
    else:
        ans += 2
else:
    if rem < 5:
        ans += 1
    else:
        ans += 2
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

result = x // 11 * 2

if x % 11 == 0:
    print(result)

elif x % 11 < 6:
    print(result + 1)

else:
    print(result + 2)

Submission status: Wrong Answer

Solution code:
x = int(input())

result = x // 11 * 2

if result % 11 == 0:
    print(result)

elif result % 11 < 6:
    print(result + 1)

else:
    print(result + 2)

Submission status: Wrong Answer

Solution code:
x = int(input())

if x % 11 > 0:
    print(x//11*2+1)

elif x % 11 > 6:
    print(x//11*2+2)

else:
    print(x//11*2)

Submission status: Wrong Answer

Solution code:
x = int(input())

if (x-1) % 11 < 5:
    print(((x-1)//11) * 2 + 1)

else:
    print(((x-1)//11) * 2 + 2)

Submission status: Wrong Answer

Solution code:
x = int(input())
ct = 0

if x >= 11:
  ct += 2*(x//11)
  x = x%11
if 0<x and x <= 5:
  ct += 1
elif 5<x and x < 11:
  ct += 2
else: 
  ct += 0
print(ct)

Submission status: Wrong Answer

Solution code:
x = int(input())
ct = 0

if x >= 11:
  ct += 2*(x//11)
  x = x%11
if 0<x and x <= 5:
  ct += 1
elif 5<x and x < 11:
  ct += 2
print(ct)

Submission status: Wrong Answer

Solution code:
x = int(input())
ct = 0
flag = 0
if x > 11:
  ct += 2*(x//11)
  x = x%11
if 0<x and x <= 5:
  ct += 1
elif 5<x and x<= 11:
  ct += 2
print(ct)

Submission status: Wrong Answer

Solution code:
x = int(input())
ct = 0
flag = 0
if x > 11:
  ct += 2*(x//11)
  x = x%11
if x <= 5:
  ct += 1
elif 5<x and x<= 11:
  ct += 2
print(ct)

Submission status: Wrong Answer

Solution code:
X = int(input())
ans = (X//11)*2
if X%11==0:
    ans += 0
elif X%11<6:
    ans += 1
else:
    ans += 2

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
sum = 0
count = 0
a = N // 11
x = N - 11 * a
if x < 7:
    x = 1
else:
    x = 2

print(2*a + x)

Submission status: Wrong Answer

Solution code:
x = int(input())
n = x // 11
d = x % 11

if d == 0:
    print(2*n)
elif d < 6:
    print(2*n+1)
else:
    print(2*(n+1))

Submission status: Wrong Answer

Solution code:
x = int(input())
n = x // 11
d = x % 11

if d < 6:
    print(2*n+1)
else:
    print(2*(n+1))

Submission status: Wrong Answer

Solution code:
x = int(input())
n = x // 11
d = x % 11
if n % 2 == 0:
    if d < 5:
        print(2*n+1)
    else:
        print(2*(n+1))

Submission status: Wrong Answer

Solution code:
x = int(input())
ans = (x // 11) * 2

if x % 11 >= 7:
    ans += 2
else:
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

result = (x // 11) * 2

if x % 11 < 7:
    result += 1
else:
    result += 2

print(result)

Submission status: Wrong Answer

Solution code:
x = int(input())
# 要するに5+6+5+6...>=xとなる最小数
count = 0
div = int(x/11)
count += div * 2
if x == div * 11:
    print(count)
elif x <= div * 11 + 5:
    print(count + 1)
else:
    print(count + 2)

Submission status: Wrong Answer

Solution code:
x = int(input())
# 要するに5+6+5+6...>=xとなる最小数
count = 0
div = int(x/11)
count += div * 2
if x <= div * 11 + 5:
    print(count + 1)
else:
    print(count + 2)

Submission status: Wrong Answer

Solution code:
n = int(input())
if n % 11 == 0:
  print(n//11)
else:
  print(n // 11 + 1)

Submission status: Wrong Answer

Solution code:
x = int(input())
i = int(x/11) * 2
if x%11 < 7:
    print(i+1)
else:
    print(i+2)

Submission status: Wrong Answer

Solution code:
def main():
    x = int(input())
    answer = int(x/11) * 2
    x %= 11
    if 0 < x and x <= 5:
        answer += 1
    elif 5 < x:
        answer += 2
    print(answer)


if __name__ == "__main__":
    main()