Go: package main

import (
	"fmt"
)

func main() {
	var A, B, N int
	fmt.Scanf("%d %d %d", &A, &B, &N)

	login := 0
	week := 0
	sum := 0

	for sum < N {
		login++
		week++
		sum += A

		if week%7 == 0 {
			sum += B
			week = 0
		}
	}

	fmt.Println(login)
}

Python: a, b, c = map(int, input().split())
ans = c//(a*7+b)*7+min((c%(a*7+b)+a-1)//a,7)
print(ans)

Python: A,B,C=map(int,input().split())
x=A*7+B
y=C//(A*7+B)
z=x*y
w=C-z

if (A*7)<w<x:
    print((y+1)*7)
else:
    coin=0
    day=0
    while coin<w:
        coin+=A
        day+=1
    print(y*7+day)

Python: a,b,c=map(int,input().split())
d,e=0,0
while d<c:
    d +=a
    e +=1
    if e%7 == 0:
        d +=b
print(e)

Python: A,B,C=map(int,input().split())

coin=0
for day in range(1,C+1):
    coin+=A
    if day%7 ==0:
        coin+=B
    if coin>=C:
        break
print(day)

Python: A,B,C=map(int,input().split())

coin=0
for i in range(1,C+1):
    coin+=A
    if i%7==0:
        coin+=B
    if coin>=C:
        break
print(i)

Python: import sys
from sys import stdin

#input = stdin.readline()

A, B, C = input().split()
A = int(A)
B = int(B)
C = int(C)

def Process(A, B, C):    #その一週間のログイン計画を演算する
    got, login = 0, 0
    if C > (7*A+B):    #一週間フルでログインしてもまだ目標に到達しない場合.
        week, remain = divmod(C, (7*A+B))
        login += (7*week)
        got += ((7*A+B)*week)

    local_date = 1
    while C > got:
        got += A
        login += 1
        local_date += 1
        if local_date == 8:
            got += B
    return login

print(Process(A, B, C))

Python: A, B, C = map(int, input().split())
n = 0 
temp = 0 
while temp < C:
	n = n + 1
	if n % 7 == 0:
		temp = temp + A + B
	else:
		temp = temp + A

print(n)

Python: #!/usr/bin/python3

import array
from fractions import Fraction
import functools
import itertools
import math
import os
import sys


def main():
    A, B, C = read_ints()
    print(solve(A, B, C))


def solve(A, B, C):
    weekly = A * 7 + B
    weeks = C // weekly
    rest = C - weekly * weeks
    days = (rest + A - 1) // A
    if days > 7:
        days = 7
    return weeks * 7 + days


###############################################################################
# AUXILIARY FUNCTIONS

DEBUG = 'DEBUG' in os.environ


def inp():
    return sys.stdin.readline().rstrip()


def read_int():
    return int(inp())


def read_ints():
    return [int(e) for e in inp().split()]


def dprint(*value, sep=' ', end='\n'):
    if DEBUG:
        print(*value, sep=sep, end=end)


if __name__ == '__main__':
    main()

Python: A,B,C = map(int,input().split())
coin = 0
for day in range(1, C+1):
     coin += A
     if day % 7 == 0:
          coin += B
     if coin >= C:  break
print(day)

Python: A,B,C = map(int,input().split())

sum=0
cnt=0

for i in range(1,C+1):
    sum=sum+A
    if i%7==0:
        sum=sum+B
    if sum>=C:
        cnt=i
        break

print(cnt)

Python: a, b, c = map(int, input().split())
ans = 0
ans += c // (a * 7 + b) * 7
c %= (a * 7 + b)
ans += min(7, c // a)
if c % a and c // a < 7:
    ans += 1
print(ans)

Python: # coding: utf-8
# Your code here!
a,b,c=map(int,input().split())

sum=0
i=0
while True:
    sum+=a
    i+=1
    if sum>=c:
        print(i)
        break
    if i%7==0:
        sum+=b
        if sum>=c:
            print(i)
            break

Python: A,B,C=map(int, input().split())

coin=0
for day in range(1, C+1) :
    coin+=A
    if day % 7 == 0 :
        coin+=B
    if coin >= C : break 
print(day)

Python: import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

def main():
    a,b,c=MI()
    week,r=divmod(c,7*a+b)
    day=(r+a-1)//a
    print(week*7+min(7,day))

main()

Python: A,B,C=map(int,input().split())
coin=0
for day in range(1,1+C): #1日からC日まで繰り返す
    coin=coin+A
    if day%7==0: 
        coin=coin+B #七日経ったらB枚のコインも追加
    if coin>=C:
        break #coinがC枚より多くなったら繰り返し終了
print(day)

Python: a,b,c=map(int,input().split())
nowpoint=0
day=0
while 1:
    if c-nowpoint<=a*6:
        day+=(c-nowpoint+a-1)//a
        break
    elif c-nowpoint<=a*7+b:
        day+=7
        break
    day+=7
    nowpoint+=a*7+b
print(day)

Python: # coding: utf-8
# Your code here!

A,B,C =map(int,input().split())

coin=0
for day in range(1,C+1):
    coin+=A
    if day % 7 == 0:
        coin+=B
    if coin >= C: break

print(day)

Python: a,b,c = map(int,input().split())

d = 0
s = 0
while s < c:
    d += 1
    if d%7 == 0:
        s += b
    s += a
print(d)

Python: 
import sys
from math import ceil

def solve(a, b, c):
    q, r = divmod(c, (a*7 + b))
    return q * 7 + min(ceil(r / a), 7)


def main(args):
    a, b, c = map(int, input().split())
    ans = solve(a, b, c)
    print(ans)


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

Python: A,B,C=map(int,input().split())
coin=0
for day in range(1,C+1):
    coin+=A
    if day % 7 == 0:
        coin+=B
    if coin >= C: break
print(day)

Python: a,b,c=map(int,input().split())
ans=0
while c>0:
	c-=a
	if ans%7==6:
		c-=b
	ans+=1
print(ans)

Python: A,B,C=map(int,input().split())
sum=0
x=0
while C>sum:
    x+=1
    sum+=A
    if x%7==0:
        sum+=B
print(x)

Python: sum_coins = 0
coin_day, coin_weekly, coin_needed = map(int, input().split())
day = 0

while sum_coins < coin_needed:
    day +=1
    sum_coins += coin_day

    if day % 7 == 0:
        sum_coins += coin_weekly
print(day)

Python: inputs = input().split()
a = int(inputs[0])
b = int(inputs[1])
c = int(inputs[2])

y = 7*c / (7*a + b)
if y - int(y) > 0:
    x = int(y) + 1
else:
    x = int(y)


while True:
    if a*x + int(x/7) * b >= c:
        print(x)
        break
    else:
        x+=1

Python: A,B,C=map(int,input().split())
D=0
E=0
while True:
    D = D+1
    E = E+A
    if D%7==0:
        E = E+B
    if E>=C:
        print(D)
        break

Python: def getInput():
    (a, b, c) = (int(i) for i in input().split(" "))
    return a, b, c

a, b, c = getInput()

n_weeklylogin = 0
n_dailylogin = 0
weekly_gain = 7*a+b

n_weeklylogin = c//weekly_gain
total_bonus = n_weeklylogin*weekly_gain

if total_bonus >= c:
    print(n_weeklylogin*7)
else:
    n_dailylogin = -(-(c-total_bonus)//a)
    print(n_weeklylogin*7 + (n_dailylogin>=7)*7 + (n_dailylogin<7)*(n_dailylogin))

Python: A, B, C = map(int, input().split())
x = A * 7 + B
ans = C // x * 7
C = C % x
y = C // A
if C % A > 0:
  y += 1
if y > 7:
  y = 7
ans += y
print(ans)

Python: a,b,c=map(int,input().split())
d=0
while c>0:
    c=c-a
    d=d+1
    if d%7==0:
        c=c-b
    
print(d)

Python: def eval(A, B, C):
    rest = C
    count = 0
    
    while True:
        for i in range(7):
            rest -= A
            if i == 6:
                rest -= B
                
            count += 1
            if rest <= 0:
                return count


A, B, C = tuple(map(int, input().split()))
print(eval(A, B, C))

Python: a,b,c = map(int,input().split())

coin=0
for day in range(1,c+1):
    coin+= a
    if day%7 == 0:
        coin+= b
    if coin >= c: break
print(day)

Python: A, B, C = (int(x) for x in input().split())
d = A*6

if C<d:
    if C%A == 0:
        print(C//A)
    if C%A > 0 :
        print(C//A+1)

if C>=d:
    D = A*7+B
    E = C%D
    F = C//D
    x = E//A
    y = E%A
    if x < 7 :
        if y == 0:
            print(F*7+x)
        if y > 0 :
            print(F*7+x+1)
    if x >= 7:
        print((F+1)*7)

Python: A,B,C=map(int,input().split())
coin=0
for day in range(1,C+1):
    coin+=A
    if day % 7 == 0:
        coin+=B
    if coin>=C:
        break
print(day)

Python: a, b, c = map(int, input().split())
ans = c // (a * 7 + b) * 7
c %= a * 7 + b
ans += min(7, (c + a - 1) // a)
print(ans)

Python: a,b,c=map(int,input().split())
cnt=0
d=0
while cnt < c:
    d+=1
    if d % 7 == 0:
        cnt+=b
    cnt+=a
print(d)