#include <iostream>

#include <cstdio>

#include <algorithm>

#include <cstring>

#include <cmath>

using namespace std;

typedef long long ll;

const int N=1e4+;

inline int read(){

    char c=getchar();int x=,f=;

    while(c<''||c>''){if(c=='-')f=-; c=getchar();}

    while(c>=''&&c<=''){x=x*+c-''; c=getchar();}

    return x*f;

}

int n,m,z,ans;

int vis[N];

int main(int argc, const char * argv[]) {

    n=read();m=read();z=read();

    for(int i=n;i<=z;i+=n) vis[i]=;

    for(int i=m;i<=z;i+=m) ans+=vis[i];

    printf("%d",ans);

    return ;

}

#include <iostream>

#include <cstdio>

#include <algorithm>

#include <cstring>

#include <cmath>

using namespace std;

typedef long long ll;

const int N=2e5+;

inline int read(){

    char c=getchar();int x=,f=;

    while(c<''||c>''){if(c=='-')f=-; c=getchar();}

    while(c>=''&&c<=''){x=x*+c-''; c=getchar();}

    return x*f;

}

int n,a[N];

int main(int argc, const char * argv[]) {

    n=read();

    for(int i=;i<=n;i++) a[i]=read();

    for(int i=;i<=n/;i++) if(i&) swap(a[i],a[n-i+]);

    for(int i=;i<=n;i++) printf("%d ",a[i]);

    return ;

}

//

//  main.cpp

//  C

//

//  Created by Candy on 2017/2/2.

//  Copyright © 2017年 Candy. All rights reserved.

//

#include <iostream>

#include <cstdio>

#include <algorithm>

#include <cstring>

#include <cmath>

using namespace std;

#define mid ((l+r)>>1)

#define lson x<<1,l,mid

#define rson x<<1|1,mid+1,r

#define lc x<<1

#define rc x<<1|1

typedef long long ll;

const int N=2e5+;

inline int read(){

    char c=getchar();int x=,f=;

    while(c<''||c>''){if(c=='-')f=-; c=getchar();}

    while(c>=''&&c<=''){x=x*+c-''; c=getchar();}

    return x*f;

}

int n,u,v,c[N],a[N];

struct edge{

    int v,ne;

}e[N<<];

int h[N],cnt=;

inline void ins(int u,int v){

    cnt++;

    e[cnt].v=v;e[cnt].ne=h[u];h[u]=cnt;

    cnt++;

    e[cnt].v=u;e[cnt].ne=h[v];h[v]=cnt;

}

struct node{

    int same;

}t[N<<];

void build(int x,int l,int r){

    if(l==r) t[x].same=a[l];

    else{

        build(lson);

        build(rson);

        if(t[lc].same==||t[rc].same==||t[lc].same!=t[rc].same) t[x].same=;

        else t[x].same=t[lc].same;

    }

}

int segSame(int x,int l,int r,int ql,int qr){

    if(ql>qr) return -;

    if(t[x].same) return t[x].same;

    if(ql<=l&&r<=qr) return t[x].same;

    else{

        int same=-;

        if(ql<=mid) same=segSame(lson,ql,qr);

        if(mid<qr){

            int _=segSame(rson,ql,qr);

            if(same==-||same==_) same=_;

            else same=;

        }

        return same;

    }

}

int d[N],L[N],R[N],dfc;

void dfs(int u,int fa){

    L[u]=++dfc; a[dfc]=c[u];

    d[u]=c[u];

    for(int i=h[u];i;i=e[i].ne){

        int v=e[i].v;

        if(v==fa) continue;

        dfs(v,u);

        if(d[u]!=&&d[v]!=d[u]) d[u]=;

    }

    R[u]=dfc;

}

int ans;

void dfsSol(int u,int fa){//printf("dfsSol %d %d\n",u,fa);

    if(ans) return;

    int flag=;

    for(int i=h[u];i;i=e[i].ne) if(e[i].v!=fa)

        if(d[e[i].v]==) {flag=;break;}

    if(flag){

        int s1=segSame(,,n,,L[u]-),s2=segSame(,,n,R[u]+,n);

        flag=;

        if(s1!=&&s2!=&&(s1==-||s2==-||s1==s2)) flag=;

//        printf("hi %d %d %d   %d %d %d\n",u,L[u],R[u],s1,s2,flag);

        if(flag) {ans=u;return;}

    }

    for(int i=h[u];i;i=e[i].ne)

        if(e[i].v!=fa) dfsSol(e[i].v,u);

}

int main(int argc, const char * argv[]) {

    n=read();

    for(int i=;i<=n-;i++) u=read(),v=read(),ins(u,v);

    for(int i=;i<=n;i++) c[i]=read();

    dfs(,);

    build(,,n);

//    for(int i=1;i<=n;i++) printf("hi %d %d %d %d\n",i,d[i],L[i],R[i]);

//    for(int i=1;i<=n;i++) printf("a %d %d\n",i,a[i]);

    dfsSol(,);

    if(ans) printf("YES\n%d",ans);

    else puts("NO");

    return ;

}

//

//  main.cpp

//  C

//

//  Created by Candy on 2017/2/2.

//  Copyright © 2017年 Candy. All rights reserved.

//

#include <iostream>

#include <cstdio>

#include <algorithm>

#include <cstring>

#include <cmath>

using namespace std;

typedef long long ll;

inline int read(){

    char c=getchar();int x=,f=;

    while(c<''||c>''){if(c=='-')f=-; c=getchar();}

    while(c>=''&&c<=''){x=x*+c-''; c=getchar();}

    return x*f;

}

int n,x,y;

int main(int argc, const char * argv[]) {

    n=read();

    puts("YES");

    for(int i=;i<=n;i++){

        x=read();y=read();

        x=min(x,read());y=min(y,read());

        x+=1e9;y+=1e9;

        if(x&){

            if(y&) puts("");

            else puts("");

        }else{

            if(y&) puts("");

            else puts("");

        }

    }

}