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:
x = int(input())

idx = x//11
ans = idx*2

if x%11 != 0:
  ans += 2
if x%11 <= 6:
  ans -= 1
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

if x <= 11:
    if x <= 5:
        print(1)
    else:
        print(2)
        
else:
    rot = x//11
    mod = x%11
    if mod > 6:
        print(2*rot + 2)
        quit()
    if mod > 0:
        print(2*rot + 1)
        quit()
    print(2*rot)

Submission status: Wrong Answer

Solution code:
x = int(input())

if x <= 11:
    if x <= 5:
        print(1)
    else:
        print(2)
        
else:
    rot = x//11
    mod = x%11
    if mod > 0:
        print(2*rot + 1)
    else:
        print(2*mod)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N=int(input())

m=N%11
ans=-(-N//11)*2

if m<=6:
    print(ans-1)
else:
    print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

if 7 <= x <= 11:
    print(2)
elif x <= 6:
    print(1)
else:
    a, b = divmod(x, 11)
    if b == 0:
        print(2*a)
    else:
        print(2*a+1)

Submission status: Wrong Answer

Solution code:
x = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())

L = [11,10,9,8,7]
ans = 0
for l in L:
    if x // l:
        ans += x // l * 2
        x %= l

print(ans+1)

Submission status: Wrong Answer

Solution code:
x = int(input())

L = [11,10,9,8,7]
ans = 0
for l in L:
    if x // l:
        ans += x // l * 2
        x %= l

print(ans+x)

Submission status: Wrong Answer

Solution code:
import sys

x = int(sys.stdin.readline())
n = x // 11
r = x % 11
if r == 0:
    print(2*n)
elif r <= 5:
    print(2*n + 1)
else:
    print(2 * (n+1))

Submission status: Wrong Answer

Solution code:
import sys

x = int(sys.stdin.readline())
n = x // 11
r = x % 11
if r <= 5:
    print(2*n + 1)
else:
    print(2 * (n+1))

Submission status: Wrong Answer

Solution code:
import math 
x = int(input())
# x = 10**15
xi = math.floor(x/5.5)
# print(xi)
for i in range(xi,10000000000000000000000000000):
    # print(6*i - math.floor(i/2))
    if(x < 6*i-math.floor(i/2)):
        xa = i
        break

print(xa)

Submission status: Wrong Answer

Solution code:
X = int(input())

t = X // (6 + 5)
a = X % (6 + 5)
b = 2 if a > 6 else 1
print(2 * t + b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():
    n = int(input())
    ans = 0
    ans += n // 11 * 2
    if n % 11 <= 6 and n % 11 != 0:
        ans += 1
    elif n % 11 <= 10 and n % 10 > 6:
        ans += 2
    print(ans)
main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x=int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())
c = x // 11
m = x % 11
cnt = 2 * (c + 1)
if m < 6:
    cnt -= 1
print(cnt)

Submission status: Wrong Answer

Solution code:
# https://atcoder.jp/contests/arc068/tasks/arc068_a

x = int(input())

ans = (x // 11) * 2
mod = x % 11
if mod < 7:
    ans += 1
else:
    ans += 2

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import bisect, copy, heapq, math, sys
from collections import *
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product
def input():
    return sys.stdin.readline()[:-1]
def ruiseki(lst):
    return [0]+list(accumulate(lst))
def celi(a,b):
    return -(-a//b)
sys.setrecursionlimit(5000000)
mod=pow(10,9)+7
al=[chr(ord('a') + i) for i in range(26)]
direction=[[1,0],[0,1],[-1,0],[0,-1]]

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

Submission status: Wrong Answer

Solution code:
x = int(input())
_x = x % 11
if _x <= 6 and _x > 0:
    _x = 1
else:
    _x = 2

print((x // 11) * 2 + _x)

Submission status: Wrong Answer

Solution code:
x = int(input())
_x = x % 11
if _x <= 6:
    _x = 1
else:
    _x = 2

print((x // 11) * 2 + _x)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = x//11*2
x %= 11

# 0 <= x < 11 になっている
if x == 0:
  pass
elif x < 6:
  ans += 1
else:
  ans += 2

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if x >= 11:
  ans += x*2 // 11
  x %= 11
while x > 0:
  x -= [6,5][ans%2]
  ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
x=int(input())
d,m=divmod(x,11)
ans=2*d
if m<7:
  ans+=1
else:
  ans+=2
print(ans)

Submission status: Wrong Answer

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

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
x = int(input())

if x <= 6:
    print(1)
    exit()

div, mod = divmod(x, 6 + 5)
# print(f'{div=}, {mod=}')

if mod <= 6:
    ans = div * 2 + 1
else:
    ans = div * 2 + 2
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())

jitubu = x//11
tiisai = x-(jitubu*11)

if tiisai>6:
    print((jitubu*2)+2)
else:
    print((jitubu*2)+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    x = I()

    # 5を上にして、6と5を交互に出す
    ans = 0
    ans += x // 11 * 2
    x %= 11
    if x <= 6:
        print(ans + 1)
    else:
        print(ans + 2)

if __name__ == '__main__':
    resolve()

Submission status: Wrong Answer

Solution code:
import sys, math
from itertools import combinations
sys.setrecursionlimit(500000)
MOD = 10**9+7

def input():
    return sys.stdin.readline()[:-1]

def mi():
    return map(int, input().split())

def ii():
    return int(input())

def i2(n):
    tmp = [list(mi()) for i in range(n)]
    return [list(i) for i in zip(*tmp)]

def main():
    x = ii()
    a = x//11
    b = x%11
    if b > 6:
        print(2*a+2)
    else:
        print(2*a+1)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
x = int(input())

tmp1 = x//11
tmp2 = x%11

ans = 2*tmp1
if tmp2 > 5:
    ans += 2
elif tmp2 > 0:
    ans += 1

print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

tmp1 = x//11
tmp2 = x%11

ans = 2*tmp1
if tmp2 > 5:
    ans += 2
else:
    ans += 1

print(ans)

Submission status: Wrong Answer

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

print(ans)

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:
def resolve():
    '''
    code here
    '''
    x = int(input())
    print((x//11)*2 + ((x%11)//7+1))



if __name__ == "__main__":
    resolve()

Submission status: Wrong Answer

Solution code:
"""
回転した後に得られる点数 = 上と下を向いている面以外の面に書かれている数
6→5→6→...と選んでいけばよさそう。
"""
X = int(input())
if X <= 6:
    print(1)
elif X <= 11:
    print(2)
else:
    cnt = X // 11
    X -= cnt * 11
    if X == 0:
        print(cnt * 2)
    elif X < 6:
        print(cnt * 2 + 1)
    else:
        print(cnt * 2 + 2)

Submission status: Wrong Answer

Solution code:
"""
回転した後に得られる点数 = 上と下を向いている面以外の面に書かれている数
6→5→6→...と選んでいけばよさそう。
"""
X = int(input())
if X < 6:
    print(1)
elif X < 11:
    print(2)
else:
    cnt = X // 11
    X -= cnt * 11
    if X == 0:
        print(cnt * 2)
    elif X < 6:
        print(cnt * 2 + 1)
    else:
        print(cnt * 2 + 2)

Submission status: Wrong Answer

Solution code:
# https://atcoder.jp/contests/arc068/tasks/arc068_a

x = int(input())

# 6の面が上向きになるように置き、次は5にする。そしてまた6に戻す。
# この2回の操作で11点獲得できる。これが2回の操作で得られる最高点である。

n = x // 11
ans = n * 2
x -= n * 11
if x <= 6:
    ans += 1
elif x > 0:
    ans += 2
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
from collections import deque, defaultdict
from math import sqrt, factorial, gcd, ceil
# def input(): return sys.stdin.readline()[:-1] # warning not \n
# def input(): return sys.stdin.buffer.readline().strip() # warning bytes
# def input(): return sys.stdin.buffer.readline().decode('utf-8')


def solve():
    # n, m = [int(x) for x in input().split()]
    n = int(input())
    ans = (n // 11)*2
    n %= 11
    if n >= 6:
        n -= 6
        ans += 1
    if n >= 5:
        ans += 1
    print(ans)
    
    
t = 1
# t = int(input())
for case in range(1,t+1):
    ans = solve()


"""

R s
S p
P r

"""

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
from collections import deque, defaultdict
from math import sqrt, factorial, gcd, ceil
# def input(): return sys.stdin.readline()[:-1] # warning not \n
# def input(): return sys.stdin.buffer.readline().strip() # warning bytes
# def input(): return sys.stdin.buffer.readline().decode('utf-8')


def solve():
    # n, m = [int(x) for x in input().split()]
    n = int(input())
    ans = n // 11
    n %= 11
    if n >= 6:
        n -= 6
        ans += 1
    if n >= 5:
        ans += 1
    print(ans)
    
    
t = 1
# t = int(input())
for case in range(1,t+1):
    ans = solve()


"""

R s
S p
P r

"""

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
from collections import deque, defaultdict
from math import sqrt, factorial, gcd, ceil
# def input(): return sys.stdin.readline()[:-1] # warning not \n
# def input(): return sys.stdin.buffer.readline().strip() # warning bytes
# def input(): return sys.stdin.buffer.readline().decode('utf-8')


def solve():
    # n, m = [int(x) for x in input().split()]
    n = int(input())
    if n <= 6:
        print(1)
    else:
        if n%2:
            print((n * 10 + 55) // 56)
        else:
            print((n * 10 + 54) // 55)
    
    
t = 1
# t = int(input())
for case in range(1,t+1):
    ans = solve()


"""

R s
S p
P r

"""

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
from collections import deque, defaultdict
from math import sqrt, factorial, gcd, ceil
# def input(): return sys.stdin.readline()[:-1] # warning not \n
# def input(): return sys.stdin.buffer.readline().strip() # warning bytes
# def input(): return sys.stdin.buffer.readline().decode('utf-8')


def solve():
    # n, m = [int(x) for x in input().split()]
    n = int(input())
    if n <= 6:
        print(1)
    else:
        print((n * 10 + 54) // 55)
    
    
t = 1
# t = int(input())
for case in range(1,t+1):
    ans = solve()


"""

R s
S p
P r

"""

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
from collections import deque, defaultdict
from math import sqrt, factorial, gcd, ceil
# def input(): return sys.stdin.readline()[:-1] # warning not \n
# def input(): return sys.stdin.buffer.readline().strip() # warning bytes
# def input(): return sys.stdin.buffer.readline().decode('utf-8')


def solve():
    # n, m = [int(x) for x in input().split()]
    n = int(input())
    if n <= 6:
        print(1)
    else:
        print(ceil(n / 5.5))
    
    
t = 1
# t = int(input())
for case in range(1,t+1):
    ans = solve()


"""

R s
S p
P r

"""

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
from collections import deque, defaultdict
from math import sqrt, factorial, gcd, ceil
# def input(): return sys.stdin.readline()[:-1] # warning not \n
# def input(): return sys.stdin.buffer.readline().strip() # warning bytes
# def input(): return sys.stdin.buffer.readline().decode('utf-8')


def solve():
    # n, m = [int(x) for x in input().split()]
    n = int(input())
    if n == 6:
        print(1)
    else:
        print(ceil(n / 5.5))
    
    
t = 1
# t = int(input())
for case in range(1,t+1):
    ans = solve()


"""

R s
S p
P r

"""

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
from collections import deque, defaultdict
from math import sqrt, factorial, gcd
# def input(): return sys.stdin.readline()[:-1] # warning not \n
# def input(): return sys.stdin.buffer.readline().strip() # warning bytes
# def input(): return sys.stdin.buffer.readline().decode('utf-8')


def solve():
    # n, m = [int(x) for x in input().split()]
    n = int(input()) * 10
    if n == 60:
        print(1)
    else:
        print((n + 54) // 55)
    
    
t = 1
# t = int(input())
for case in range(1,t+1):
    ans = solve()


"""

R s
S p
P r

"""

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
from collections import deque, defaultdict
from math import sqrt, factorial, gcd
# def input(): return sys.stdin.readline()[:-1] # warning not \n
# def input(): return sys.stdin.buffer.readline().strip() # warning bytes
# def input(): return sys.stdin.buffer.readline().decode('utf-8')


def solve():
    # n, m = [int(x) for x in input().split()]
    n = int(input()) * 10
    print((n + 54) // 55)
    
    
t = 1
# t = int(input())
for case in range(1,t+1):
    ans = solve()


"""

R s
S p
P r

"""

Submission status: Wrong Answer

Solution code:
import sys


def input(): return sys.stdin.readline().strip()
def I(): return int(input())
def LI(): return list(map(int, input().split()))
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def S(): return input()
def LS(): return input().split()


INF = float('inf')


x = I()
if x <= 6:
    ans = 1
elif x <= 11:
    ans = 2
else:
    ans = (x // 11) * 2
    if x % 11 == 0:
        pass
    elif x % 11 <= 6:
        ans += 1
    elif x % 11 <= 10:
        ans += 2

    print(ans)

Submission status: Wrong Answer

Solution code:
import sys


def input(): return sys.stdin.readline().strip()
def I(): return int(input())
def LI(): return list(map(int, input().split()))
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def S(): return input()
def LS(): return input().split()


INF = float('inf')


x = I()
if x <= 6:
    ans = 1
elif x <= 11:
    ans = 2
else:
    ans = (x // 11) * 2
    if ans % 11 != 0:
        ans += 1

    print(ans)

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())

print((x//11)*2+int("01111122222"[x%11]))

Submission status: Wrong Answer

Solution code:
x = int(input())

if x == 1:
	print(0)
	exit()

print(((x-1)//11)*2+int("01111122222"[(x-1)%11]))

Submission status: Wrong Answer

Solution code:
x = int(input())

if x == 1:
	print(0)
	exit()

print(((x-1)//11)*2+int("11111122222"[(x-1)%11]))

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.buffer.readline

#sys.setrecursionlimit(10**9)
#from functools import lru_cache

def RD(): return sys.stdin.read()
def II(): return int(input())
def MI(): return map(int,input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int,input().split()))
def LF(): return list(map(float,input().split()))
def TI(): return tuple(map(int,input().split()))
# rstrip().decode()

def main():
	x=II()
	q,r=divmod(x,11)

	ans=2*q+1+(r>6)

	print(ans)


if __name__ == "__main__":
	main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations,permutations,accumulate # (string,3) 3回
#from collections import deque
from collections import deque,defaultdict,Counter
import decimal
import re
#import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#

import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7
#mod = 9982443453
def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
x = I()
div = x // 11
ans = div * 2
x -= div * 11
if x >= 6:
    ans += 2
elif x >= 1:
    ans += 1
else:
    ans += 0
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# hello worldと表示する
# coding: utf-8
# hello worldと表示する
#float型を許すな
#numpyはpythonで
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil,pi,factorial
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
def SI(): return input().rstrip()
def printns(x): print('\n'.join(x))
def printni(x): print('\n'.join(list(map(str,x))))
inf = 10**17
mod = 10**9 + 7

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if x%11 <= 5:
    print(ans+1)
else:
    print(ans+2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
a = n//11
b = n%11
if b == 0:
    print(2*a)
elif b <= 5:
    print(2*a+1)
elif b <= 10:
    print(2*a+2)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = n//11
b = n%11
if b == 0:
    print(a)
elif b <= 5:
    print(2*a+1)
elif b <= 10:
    print(2*a+2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())
print(int(-(-x//5.5)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
time = 0
sum = 0
x = int(input())
sho = x//11
ans = 2*sho
mod = x % 11
if mod < 5:
    print(ans+1)
else:
    print(ans+2)

Submission status: Wrong Answer

Solution code:
x = int(input())

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

Submission status: Wrong Answer

Solution code:
x = int(input())

if 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)+1)
else:
    print(2*(-(-x//11)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x=int(input())
c=x//11
d=x%11
if c==0 and d<=5:
  print(1)
elif c==0 and d<=10:
  print(2)
elif d==0:
  print(2*c)

elif d<=5:
  print(2*c+1)
else:
  print(2*c+2)

    
    
#c=0を書く

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x=int(input())
ans=0
for i in range(100000000):
  if (i+1)%2==1:
    x-=5
    ans+=1
    if x<=0:
      print(ans)
      break
  else:
    x-=6
    ans+=1
    if x<=0:
      print(ans)
      break

Submission status: Wrong Answer

Solution code:
x=int(input())
ans=0
for i in range(100000000000):
  if (i+1)%2==1:
    x-=5
    ans+=1
    if x<=0:
      print(ans)
      break
  else:
    x-=6
    if x<=0:
      print(ans)
      break

Submission status: Wrong Answer

Solution code:
x=int(input())

cnt=x%11

ans=2*(x//11)
if cnt<=6:
    ans+=1
else:
    ans+=2

print(ans)

Submission status: Wrong Answer

Solution code:
def myAnswer(x:int) -> int:
   total = 0
   if (x > 11):
      total = x // 11 * 2
      x = x % 11
   if(x <= 6):
      return total + 1
   else:
      return total + 2


def modelAnswer():
   return
def main():
   x = int(input())
   print(myAnswer(x))

if __name__ == '__main__':
   main()

Submission status: Wrong Answer

Solution code:

def myAnswer(x:int) -> int:
   total = 0
   if (x >= 11):
      total = x // 11 * 2
      x = x % 11
   if(x <= 6):
      return total + 1
   else:
      return total + 2


def modelAnswer():
   return
def main():
   x = int(input())
   print(myAnswer(x))

if __name__ == '__main__':
   main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())
#6と5を繰り返す
if x%11==0: print(x//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())
#6と5を繰り返す
if x%11 < 6: print(x//11*2+1)
else: print(x//11*2+2)

Submission status: Wrong Answer

Solution code:
x = int(input())

n = (x//11)

x -= n*11
r = 0
if 0 < x <= 5:
    r = 1
else:
    r = 2

print(2*n+r)

Submission status: Wrong Answer

Solution code:
from math import ceil

x = int(input())

n = (x//11)

x -= n*11
r = 0
if 0 < x <= 6:
    r = 1
else:
    r = 2

print(2*n+r)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from math import ceil

x = int(input())

n = (x//11)

x = x%11
r = 0
if 0 < x <= 6:
    r = 1
else:
    r = 2

print(2*n+r)

Submission status: Wrong Answer

Solution code:
from math import ceil

x = int(input())

n = (x//11)

x = x%10
r = 0
if 0 < x <= 6:
    r = 1
else:
    r = 2

print(2*n+r)

Submission status: Wrong Answer

Solution code:
x = int(input())
a = x//11
b = x%11

if b > 6:
    print(2*a+2)
else:
    print(2*a+1)

Submission status: Wrong Answer

Solution code:
x = int(input())

quotinent = x // 11
remainder = x % 11

if remainder <= 6:
  print(2*quotinent+1)
else:
  print(2*quotinent+2)

Submission status: Wrong Answer

Solution code:
x = int(input())

dice = 6
ans = 0

while dice > 0:
    ans += x//dice
    x = x%dice
    dice -= 1

print(ans)

Submission status: Wrong Answer

Solution code:

n = int(input())
n-=1
ans = (n//11)*2
if(n%11<=5):
    ans+=1
else:
    ans+=2
print(n%11)
print(ans)

Submission status: Wrong Answer

Solution code:


n = int(input())
n-=1
ans = (n//11)*2
if(n%11<=4):
    ans+=1
else:
    ans+=2

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())

div, mod = divmod(x, 11)
div *= 2

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

print(div)

Submission status: Wrong Answer

Solution code:
n = int(input())
d, m = divmod(n, 11)
ans = d*2
if m > 6:
    ans += 2
else:
    ans += 1
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def solve():
    x = int(input())
    n = x // 11
    if x == n * 11:
        return 2 * n
    elif n * 11 < x <= n * 11 + 5:
        return 2 * n + 1
    elif n * 11 + 5 < x <= n * 11 + 11:
        return 2 * n + 2

print(solve())

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
"""
10**15なので，ループで割ることを考える
1 + (6, 5)
"""

x = int(input())
count = (x // 11) * 2
x = x % 11
if x > 6:
    print(count+2)
elif x > 0:
    print(count+1)