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:
# -*- coding: utf-8 -*-
x = int(input())

ans = (x // 11)
point = ans * 11
ans *= 2
#print(point)
while point < x:
    if ans % 2 == 0:
        point += 5
        ans += 1
    else:
        point += 6
        ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
x = int(input())

ans = (x // 11) * 2
point = ans * 11
while point < x:
    if ans % 2 == 0:
        point += 5
        ans += 1
    else:
        point += 6
        ans += 1
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:
x=int(input())

y=x//11
z=x-11*y #あまり

if z<=6:
  print(2*y+1)
else:
  print(2*y+2)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
n = int(input())

if n <= 6:
  print(1)
  exit()
  
if n <= 11:
  print(2)
  exit()
  
d = n//11
if n % 11 == 0:
  print(d*2)
  exit()
  
roku = n - (d*11)
print((d * 2) + 1)

Submission status: Wrong Answer

Solution code:
a = int(input())

t = 0
if a <= 6:
    t = 1
else:
    ans = (a - 11)//11
    if ans < 0:
        ans  = 0
    t += ans * 2
    a -= ans * 11
    if a <= 6:
        t += 1
    elif 7 <= a <= 11:
        t += 2
    else:
        t += 3
print(t)

Submission status: Wrong Answer

Solution code:
import sys
read_=sys.stdin.buffer.readline
x=int(read_())
if x<=6:
    print(1)
else:
    print(int(-(-x/11*2//1)))

Submission status: Wrong Answer

Solution code:
import sys
read_=sys.stdin.buffer.readline
x=int(read_())
print(int(-(-x/11*2//1)))

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
mod = 10 ** 9 + 7
inf = float('inf')
ninf = -float('inf')
 
#整数input
def ii(): return int(sys.stdin.readline().rstrip()) #int(input())
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) #list(map(int,input().split()))
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]
#文字列input
def ss(): return sys.stdin.readline().rstrip() #input()
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) #list(input().split())
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]

#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？

x=ii()
if x<=6:
    print(1)
    exit()
elif x<=11:
    print(2)
    exit()

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

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

Submission status: Wrong Answer

Solution code:
n = int(input())

a = n // 11
b = n % 11

ans = 0
if b <= 6:
    ans += 1
elif b >= 7 and b <= 10:
    ans += 2

ans += a * 2 

print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())

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

Submission status: Wrong Answer

Solution code:
n = int(input())

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8

class Proc:
    def __init__(self):
        self.x = int(input().rstrip())

    def get_ans(self):
        if self.x <= 0:
            return 0
        if self.x <= 5:
            return 1
        if self.x <= 11:
            return 2
        ans = int(self.x / 11) * 2
        self.x = self.x % 11
        ans += self.get_ans()
        return ans


print(Proc().get_ans())

Submission status: Wrong Answer

Solution code:
N=int(input())
count=0
ans=0
tmp=5
ans=(N//11)*2
if N%11>6:
	print(ans+2)
else:
	print(ans+1)

Submission status: Wrong Answer

Solution code:
import math
x=int(input())
if x<=6:
    print(1)
    exit()

ans=math.ceil(x/11)*2
if ans//2*11-x>=6:
    ans+=-1

print(ans if x>11 else 2)

Submission status: Wrong Answer

Solution code:
import math
x=int(input())
if x<=6:
    print(0)
    exit()

ans=math.ceil(x/11)*2
if ans//2*11-x>=6:
    ans+=-1

print(ans if x>11 else 1)

Submission status: Wrong Answer

Solution code:
import math
x=int(input())
if x<=5:
    print(1)
    exit()
    
ans=math.ceil(x/11)*2
if ans//2*11-x>=6:
    ans+=-1

print(ans if x>=11 else 2)

Submission status: Wrong Answer

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

ans=math.ceil(x/11)*2
if ans//2*11-x<=6:
    ans+=-1

print(ans if x>=11 else 2)

Submission status: Wrong Answer

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

ans=math.ceil(x/11)*2
if ans//2*11-x>=6:
    ans+=-1

print(ans if x>=11 else 2)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
N = int(input())

def solve(N):
    ans = 0
    a = (N // 11) * 2
    b = N % 11
    
    if b == 0:
        ans = a
    elif 0 < b <= 5:
        ans = a + 1
    else:
        ans = a + 2
    return ans

print(solve(N-1))

Submission status: Wrong Answer

Solution code:
N = int(input())

def solve(N):
    ans = 0
    a = (N // 11) * 2
    b = N % 11
    
    if b == 0:
        ans = a
    elif 0 < b <= 5:
        ans = a + 1
    else:
        ans = a + 2
    return ans

print(solve(N))

Submission status: Wrong Answer

Solution code:
N = int(input())

def solve(N):
    ans = 0
    a = (N // 11) * 2
    b = N % 11
    
    if b == 0:
        ans = a
    elif 0 < b <= 5:
        ans = a + 1
    elif 6 <= b <= 10:
        ans = a + 2
    return ans

print(solve(N))

Submission status: Wrong Answer

Solution code:
N = int(input())

ans = 0

a = (N // 11) * 2
b = N % 11

if b == 0:
    ans = a
elif 0 < b <= 5:
    ans = a + 1
else:
    ans = a + 2

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

ans = 0

a = N // 11
b = N % 11

if b == 0:
    ans = a
elif 0 < b <= 5:
    ans = a*2 + 1
else:
    ans = a*2 + 2

print(ans)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
from _collections import defaultdict
from functools import lru_cache

class cin():
    def int():
        return int(sys.stdin.readline().rstrip())
    def string():
        return sys.stdin.readline().rstrip()
    def mapInt():
        return [int(x) for x in cin.string().split()]
    def stringList(n):
        return [input() for i in range(n)]
    def intListList(n):
        return [cin.mapInt() for i in range(n)]
    def intColsList(n):
        return [int(input()) for i in range(n)]
        
class Math():
    def gcd(a,b):
        if b == 0:
            return a
        return Math.gcd(b,a % b)
    def lcm(a,b):
        return (a * b) // Math.gcd(a,b)
    def roundUp(a,b):
        return -(-a // b)
    def toUpperMultiple(a,x):
        return Math.roundUp(a,x) * x
    def toLowerMultiple(a,x):
        return (a // x) * x
    def nearPow2(n):
        if n <= 0:
            return 0
        if n & (n - 1) == 0:
            return n
        ret = 1
        while(n > 0):
            ret <<= 1
            n >>= 1
        return ret
    def isPrime(n):
        if n < 2:
            return False
        if n == 2:
            return True
        if n % 2 == 0:
            return False
        d = int(n ** 0.5) + 1
        for i in range(3,d + 1,2):
            if n % i == 0:
                return False
        return True

MOD = int(1e09) + 7

def main():
    N = cin.int()
    ans = (N // 11) * 2
    if N % 11 == 0:
        ans
    elif N % 11 <= 5:
        ans += 1
    else:
        ans +=2
    print(ans)
    return

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
from _collections import defaultdict
from functools import lru_cache

class cin():
    def int():
        return int(sys.stdin.readline().rstrip())
    def string():
        return sys.stdin.readline().rstrip()
    def mapInt():
        return [int(x) for x in cin.string().split()]
    def stringList(n):
        return [input() for i in range(n)]
    def intListList(n):
        return [cin.mapInt() for i in range(n)]
    def intColsList(n):
        return [int(input()) for i in range(n)]
        
class Math():
    def gcd(a,b):
        if b == 0:
            return a
        return Math.gcd(b,a % b)
    def lcm(a,b):
        return (a * b) // Math.gcd(a,b)
    def roundUp(a,b):
        return -(-a // b)
    def toUpperMultiple(a,x):
        return Math.roundUp(a,x) * x
    def toLowerMultiple(a,x):
        return (a // x) * x
    def nearPow2(n):
        if n <= 0:
            return 0
        if n & (n - 1) == 0:
            return n
        ret = 1
        while(n > 0):
            ret <<= 1
            n >>= 1
        return ret
    def isPrime(n):
        if n < 2:
            return False
        if n == 2:
            return True
        if n % 2 == 0:
            return False
        d = int(n ** 0.5) + 1
        for i in range(3,d + 1,2):
            if n % i == 0:
                return False
        return True

MOD = int(1e09) + 7

def main():
    N = cin.int()
    ans = (N // 11) * 2
    if N % 11 <= 5:
        ans += 1
    else:
        ans +=2
    print(ans)
    return

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

print(math.floor(ans))

Submission status: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

Solution code:
import math

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

print(math.floor(ans))

Submission status: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
 
if x % 11 == 0:
    ans = x // 11 * 2
else:
    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())
 
if x % 11 == 0:
    ans = x // 11 * 2
else:
    if x / 11 < 1:
        if x // 6 > 1:
            ans = 2
        else:
            ans = 1
    else:
        ans = x // 11 * 2 + 1
 
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())

if x / 11 < 1:
    ans = 1
    if x / 5 >= 1:
        ans = 2
else:
    ans = x // 11 * 2 + 1

print(ans)

Submission status: Wrong Answer

Solution code:
import math

x = int(input())

if x % 11 == 0:
    ans = x / 11 * 2
else:
    ans = x / 11 * 2 + 1

print(math.floor(ans))

Submission status: Wrong Answer

Solution code:
x = int(input())

ans = (x//11)*2
m = x % 11
if m == 0:
    pass
elif m <= 5:
    ans += 1
else:
    ans += 2

print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

print(int(-(-((x/11)*2)//1)))

Submission status: Wrong Answer

Solution code:
x = int(input())

if x <= 6:
    print(1)
else:
    q, m = divmod(x, 11)
    ans = q*2

    while m >= 0:
        m -= ([6, 5])[ans%2]
        ans += 1

    print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

if x <= 6:
    print(1)
else:
    q, m = divmod(x, 11)
    ans = q*2

    while m >= 0:
        m -= ([5, 6])[ans%2]
        ans += 1

    print(ans)

Submission status: Wrong Answer

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

if x <= 6:
    print(1)
else:
    q, m = divmod(x, 11)
    ans = q*2

    while m >= 0:
        m -= ([5, 6])[m%2]
        ans += 1

    print(ans)

Submission status: Wrong Answer

Solution code:
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    x = int(readline())
    print(x // 11 * 2 + (x % 11 + 6 - 1) // 6 + (x % 11 & 6 + 5 - 1) // 5)


if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

Solution code:
N=int(input())
# ２回で１１増える
syo=N//11
amari=N%11
gosa=0
if amari>6:
    gosa=2
if (1<amari) and (amari<=6):
    gosa=1
print(syo*2+gosa)

Submission status: Wrong Answer

Solution code:
N=int(input())
# ２回で１１増える
syo=N//11
amari=N%11
gosa=0
if amari>6:
    gosa=2
if amari<=6:
    gosa=1
print(syo*2+gosa)

Submission status: Wrong Answer

Solution code:
# coding: utf-8
from math import ceil
X = int(input())
if X <= 6:
    print(1)
else:
    mod = X % 11
    if mod >= 7:
        print(X // 11 * 2 + 2)
    else:
        print(X // 11 * 2 + 1)

Submission status: Wrong Answer

Solution code:
# coding: utf-8
from math import ceil, floor
X = int(input())
if X <= 6:
    print(1)
else:
    print(ceil(X / 11 * 2))

Submission status: Wrong Answer

Solution code:
# coding: utf-8
from math import ceil, floor
X = int(input())
if X >= 6:
    print(1)
else:
    print(ceil(X / 11 * 2))

Submission status: Wrong Answer

Solution code:
# coding: utf-8
from math import ceil
X = int(input())
print(ceil((X) / 11 * 2))

Submission status: Wrong Answer

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

def solve():
    x = int(input())
    res = 2*ceil(x/11) - (x%11 <= 6)
    return str(res)

if __name__ == '__main__':
    print(solve())

Submission status: Wrong Answer

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

def solve():
    x = int(input())
    res = 2*(x//11) + (x%11!=0)
    return str(res)

if __name__ == '__main__':
    print(solve())

Submission status: Wrong Answer

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

def solve():
    x = int(input())
    res = ceil(2*x/11)
    return str(res)

if __name__ == '__main__':
    print(solve())

Submission status: Wrong Answer

Solution code:
x=int(input())
div = x//11
rem = x%11

if(rem>6):
    print(2*div+2)
else:
    print(2*div+1)

Submission status: Wrong Answer

Solution code:
N = int(input())

mod = 11
ans = 0

if N % mod == 0:
    ans = N / mod * 2
elif N % mod >= 1 and N % mod <= 6:
    ans = N // mod * 2 + 1
else:
    ans = N // mod * 2 + 2

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

X = N // 11
M = N % 11
print(X, M)
if M == 0:
    print(X * 2)
elif M > 6:
    print(X * 2 + 2)
else:
    print(X * 2 + 1)

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:
n=int(input())
if n==6:
    print(1)
elif n==7:
    print(3)
else:
    if (n-11*(n//11))%7!=0:
        print( (n//11)*2 + (n-11*(n//11))//6 + 1)
    else:
        print( (n//11)*2 + (n-11*(n//11))//6 + 2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if x <= 5:
    print(1)
    sys.exit()
if x <= 11:
    print(2)
    sys.exit()

div = (x // 11)
modulo = (x % 11)

if 1 <= modulo <= 6:
    print(div * 2 + 1)
elif 6 < modulo <= 10:
    print(div * 2 + 2)
elif modulo == 0:
    print(div * 2)

Submission status: Wrong Answer

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

if x <= 5:
    print(1)
    sys.exit()
if x <= 11:
    print(2)
    sys.exit()

div = x // 11
modulo = x % 11

if 1 <= modulo <= 5:
    print(div * 2 + 1)
elif 6 <= modulo <= 10:
    print(div * 2 + 2)
elif modulo == 0:
    print(div * 2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
N = int(input())
x = math.floor(N/11)
y = N%11
if y==0:
    print(2*x)
elif y<=5:
    print(2*x+1)
else:
    print(2*x+2)

Submission status: Wrong Answer

Solution code:
import math
N = int(input())
x = math.floor(N/11)
y = N%11
if y<=5:
    print(2*x+1)
else:
    print(2*x+2)

Submission status: Wrong Answer

Solution code:
N = int(input())
sum_num = 0
count = 0 
while sum_num<N:
    if count%2==0:
        sum_num += 5
    else:
        sum_num += 6
    count+=1
print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x=int(input())

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

Submission status: Wrong Answer

Solution code:
x=int(input())

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

Submission status: Wrong Answer

Solution code:
x=int(input())

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

Submission status: Wrong Answer

Solution code:
X = int(input())

N=(X//11)*2
P=X%11

if(P>6):
    print(N+2)
else:
    print(N+1)

Submission status: Wrong Answer

Solution code:
X = int(input())

N=X/11
P=X%11

if(P>6):
    print(2*N+2)
else:
    print(2*N+1)

Submission status: Wrong Answer

Solution code:
X = int(input())

N=X//11
P=X%11

if(P>6):
    print(2*N+2)
else:
    print(2*N+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    x = int(input().rstrip('\n'))
    cnt = (x + 10) // 11 * 2
    if x % 11 <= 6:
        print(cnt-1)
    else:
        print(cnt)


if __name__ == '__main__':
    slove()

Submission status: Wrong Answer

Solution code:
x = int(input())
x -=1

tmp = x//11
tmp *= 2
a = x%11

if a == 0:
    tmp = tmp
elif a <= 6:
    tmp += 1
else:
    tmp += 2

print(tmp)

Submission status: Wrong Answer

Solution code:
x = int(input())
x -=1

tmp = x//11
tmp *= 2
a = x%11

if a == 0:
    tmp = tmp
elif a <= 5:
    tmp += 1
else:
    tmp += 2

print(tmp)

Submission status: Wrong Answer

Solution code:
x = int(input())

tmp = x//11
tmp *= 2
a = x%11

if a == 0:
    tmp = tmp
elif a <= 5:
    tmp += 1
else:
    tmp += 2

print(tmp)

Submission status: Wrong Answer

Solution code:
x = int(input())

tmp = x//11
tmp *= 2
a = x%11

if a <= 5:
    tmp += 1
else:
    tmp += 2

print(tmp)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N=int(input())
ans=2*((N+10)//11)
if N%11 < 5:
    ans-=1
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# 2019/08/11

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

Submission status: Wrong Answer

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

def main():
    x = int(input())

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


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = int(input())
print((a + 4.5) // 5.5)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/

import math
import statistics

# fact(int)
def fact(n):
  if(n == 1):
    return 1
  else:
    return (n * fact(n - 1))

# gcd(int,int)
def gcd(a,b):
  if a == 0:
    return b
  elif b == 0:
    return a
  else:
    return gcd(b,a % b)

# lcm(int,int)
def lcm(a,b):
  return (a * b / gcd(a,b))

# qsort(array[])
def qsort(seq):
  if len(seq) < 1:
      return seq
  pivot = seq[0]
  left = []
  right = []
  for x in range(1, len(seq)):
    if seq[x] <= pivot:
        left.append(seq[x])
    else:
        right.append(seq[x])
  left = qsort(left)
  right = qsort(right)
  foo = [pivot]
  return (left + foo + right)

# , = map(int, input.split())
#  = int(input())
n = int(input())
cnt = 2 * (n // 11)
n = n % 11
if n <= 6:
  cnt += 1
else:
  cnt += 2
print(cnt)

Submission status: Wrong Answer

Solution code:
x = int(input())

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

Submission status: Wrong Answer

Solution code:
# ARC068C - X: Yet Another Die Game
def main():
    x = int(input())
    if x <= 6:
        print(1)
    elif x <= 11:
        print(2)
    else:
        ans = x // 11 * 2
        x %= 11
        print(ans + 1 if x <= 6 else ans + 2)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
# ARC068C - X: Yet Another Die Game
def main():
    x = int(input())
    if x <= 6:
        print(1)
    elif x <= 11:
        print(2)
    else:
        print(x // 11 * 2 + 1)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())
ans, rem = divmod(x, 11)
ans *= 2
if 0 < rem <= 6:
    ans += 1
elif 7 <= rem < 10:
    ans += 2
print(ans)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
"""
C - X: Yet Another Die Game
https://atcoder.jp/contests/arc068/tasks/arc068_a

"""
import sys


def solve(x):
    if x <= 5:
        return 1
    q, r = divmod(x, 11)
    ans = q * 2
    if r:
        ans += 1 if r <= 5 else 2
    return ans


def main(args):
    x = int(input())
    ans = solve(x)
    print(ans)

    # assert solve(11) == 2
    # assert solve(7) == 2
    # assert solve(149696127901)== 27217477801
    # assert solve(5) == 1
    # assert solve(16) == 3
    # assert solve(22) == 4


if __name__ == '__main__':
    main(sys.argv[1:])

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
"""
C - X: Yet Another Die Game
https://atcoder.jp/contests/arc068/tasks/arc068_a

"""
import sys

from math import ceil

def solve(x):
    if x <= 5:
        return 1
    q, r = divmod(x, 11)
    ans = q * 2
    ans += 1 if r <= 5 else 2
    return ans


def main(args):
    x = int(input())
    ans = solve(x)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())

res = 0

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())

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

print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
trial_num = 0

n_reminder = n % 11

if(n_reminder<=6):
    print((n//11)*2 + 1)
elif(7 <= n_reminder <= 11):
    print((n//11)*2 + 2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())
count = 0
c = 0
count = x // 11
y = x - count * 11
count *= 2
if 0 < y <= 6:
  count += 1
elif 6 <= y < 10:
  count += 2


print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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