Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

func main() {
	io := NewIo()
	defer io.Flush()
	for {
		s := io.NextLine()
		if s == "." {
			break
		}
		t := io.NextLine()
		if s == t {
			io.Println("IDENTICAL")
			continue
		}
		ss := strings.Split(s, "\"")
		tt := strings.Split(t, "\"")
		if len(ss) != len(tt) {
			io.Println("DIFFERENT")
			continue
		}
		cnt := 0
		for i := 0; i < len(ss); i++ {
			if i%2 == 0 {
				if ss[i] != tt[i] {
					cnt = -1
					break
				}
			} else {
				if ss[i] != tt[i] {
					cnt++
				}
			}
		}
		if cnt > 1 || cnt == -1 {
			io.Println("DIFFERENT")
		} else {
			io.Println("CLOSE")
		}
	}
}

// I/O template
type Io struct {
	reader    *bufio.Reader
	writer    *bufio.Writer
	tokens    []string
	nextToken int
}

func NewIo() *Io {
	return &Io{
		reader: bufio.NewReader(os.Stdin),
		writer: bufio.NewWriter(os.Stdout),
	}
}

func (io *Io) Flush() {
	err := io.writer.Flush()
	if err != nil {
		panic(err)
	}
}

func (io *Io) NextLine() string {
	var buff []byte
	for {
		line, isPrefix, err := io.reader.ReadLine()
		if err != nil {
			panic(err)
		}
		buff = append(buff, line...)
		if !isPrefix {
			break
		}
	}
	return string(buff)
}

func (io *Io) Next() string {
	for io.nextToken >= len(io.tokens) {
		line := io.NextLine()
		io.tokens = strings.Fields(line)
		io.nextToken = 0
	}
	s := io.tokens[io.nextToken]
	io.nextToken++
	return s
}

func (io *Io) NextInt() int {
	i, err := strconv.Atoi(io.Next())
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) NextFloat() float64 {
	i, err := strconv.ParseFloat(io.Next(), 64)
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) Println(a ...interface{}) {
	fmt.Fprintln(io.writer, a...)
}

func (io *Io) Printf(format string, a ...interface{}) {
	fmt.Fprintf(io.writer, format, a...)
}

func (io *Io) PrintIntSlice(a []int) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func (io *Io) PrintStringSlice(a []string) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func Log(name string, value interface{}) {
	fmt.Fprintf(os.Stderr, "%s=%+v\n", name, value)
}

func ExampleIo() {
	io := NewIo()
	defer io.Flush()
	a := make([]int, 0, 3)
	a[0], a[1], a[2] = io.NextInt(), io.NextInt(), io.NextInt()
	io.Println(a)
	io.PrintIntSlice(a)
	Log("io", a)
}

C++: #include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <bitset>
#include <complex>
#include <unistd.h>
#include <cassert>
#include <cctype>
#include <random>
#define _USE_MATH_DEFINES
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef tuple<int, int, int> tiii;
typedef tuple<ll, ll, ll> tlglglg;
typedef complex<double> xy_t;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
double pi = 3.141592653589793;
ll mod = 1000000007;
int intmax = 2147483647;
int intmin = -2147483648;
ll llmax = 9223372036854775807;
ll llmin = -9223372036854775807;
ll inf = llmax / 2;
double eps = 1e-11;

int main() {
    while (true) {
        string s1, s2;
        cin >> s1;
        if (s1 == ".") {
            break;
        }
        cin >> s2;
        vector<char> s1ch[200];
        vector<char> s2ch[200];
        int num1 = 0;
        for (int i = 0; i < s1.size(); i++) {
            if (s1[i] == '"') {
                num1++;
            } else {
                s1ch[num1].push_back(s1[i]);
            }
        }
        int num2 = 0;
        for (int i = 0; i < s2.size(); i++) {
            if (s2[i] == '"') {
                num2++;
            } else {
                s2ch[num2].push_back(s2[i]);
            }
        }
        int mark = 0;
        if (num1 != num2) {
            mark = 2;
        }
        for (int i = 0; i <= num1; i++) {
            bool m = true;
            int a = s1ch[i].size();
            int b = s2ch[i].size();
            if (a != b) {
                m = false;
            } else {
                for (int j = 0; j < a; j++) {
                    if (s1ch[i][j] != s2ch[i][j]) {
                        m = false;
                    }
                }
            }
            if (!m) {
                if (i % 2 == 0) {
                    mark = 2;
                } else {
                    if (mark < 2) {
                        mark++;
                    }
                }
            }
        }
        if (mark == 0) {
            cout << "IDENTICAL" << endl;
        } else if (mark == 1) {
            cout << "CLOSE" << endl;
        } else {
            cout << "DIFFERENT" << endl;
        }
    }
}

C++: #include <iostream>

using namespace std;

int main(void) {
	int sind,tind,diff;
	string s,t,ss,st;
	while (cin >> s, s != ".") {
		cin >> t;
		diff = sind = tind = 0;
		while (diff < 2 && sind < s.length() && tind < t.length()) {
			if (s[sind] != t[tind]) {
				diff = 2;
			}
			else {
				if (s[sind] == '\"') {
					++sind;
					ss = "";
					while (s[sind] != '\"') {
						ss += s[sind];
						++sind;
					}
					st = "";
					++tind; 
					while (t[tind] != '\"') {
						st += t[tind];
						++tind;
					}
					if (ss != st) {
						++diff;
					}
				}
			}
			++sind;
			++tind;
		}
		if (sind < s.length() || tind < t.length()) {
			diff = 2;
		}
		if (diff == 0) {
			cout << "IDENTICAL" << endl;
		}
		else if (diff == 1) {
			cout << "CLOSE" << endl;
		}
		else {
			cout << "DIFFERENT" << endl;
		}
	}
	return 0;
}

C++: #include<iostream>
#include<vector>
#include<string>
int main(){
	int i,j,k,l,m,lim,flag1=0,flag2,flag3,flag4,count=0,x,scou1=0,scou2=0;
	std::string s1,str1;
	std::string s2,str2;
	std::vector<std::string> ans;

	while(1){
		std::cin>>str1;

		
		i=0;
		while(str1[i]!=NULL){
			s1.push_back(str1[i]);
			i++;
		}
//		std::cout<<s1<<"\n";
		if(s1=="."){
//			std::cout<<s1<<"\n";
			break;
		}
		std::cin>>str2;
		k=0;
		while(str2[k]!=NULL){
			s2.push_back(str2[k]);
			k++;
		}
	
//		std::cout<<s2<<"\n";
//		std::cout<<i<<"\n";
		
		scou1=0;
		scou2=0;
		flag1=0;
		flag2=0;
		flag3=0;
		flag4=0;
		if(i<k){
			l=i;
			lim=k;
		}else{
			l=k;
			lim=i;
		}
		j=0;
		m=0;
		for(int z=0;z<l;z++){
			if(s1[j]=='"'){
				scou1++;
			}
			if(s2[m]=='"'){
				scou2++;
			}
			
			//std::cout<<s1[j]<<" "<<s2[m]<<"\n";
			
			if(s1[j]!=s2[m]){
				if(flag4==1){
					flag2=1;
					break;
				}
				if(scou1%2==1&&scou2%2==1){
					flag2=2;
					flag3=1;
				}else if(scou1%2==1){
					if(s1[j]!='"'){
						while(s1[j]!='"'){
							j++;
						}
						scou1++;
						flag2=2;
						flag3=1;
					}else{
						flag2=1;
						break;
					}
				}else if(scou2%2==1){
					if(s2[m]!='"'){
						while(s2[m]!='"'){
							m++;
						}
						scou2++;
						flag2=2;
						flag3=1;
					}else{
						flag2=1;
						break;
					}
				}else{
					flag2=1;
					break;
				}
				
				
			}
			if(flag3==1&&scou1%2==0&&scou2%2==0){
					flag4=1;
					//std::cout<<"tutgihanai\n";
				}
			j++;
			m++;
		}
		
		if(m<lim&&j<lim){
			flag2=1;
		}
		
//		std::cout<<m<<j<<lim<<"\n";
		
		if(flag2==0){
			ans.push_back("IDENTICAL");
		}else if(flag2==1){
			ans.push_back("DEFFERENT");
		}else{
			ans.push_back("CLOSE");
		}
		//std::cout<<ans[count]<<"\n";
		
		count++;
		s1.erase(s1.begin(),s1.end());
		s2.erase(s2.begin(),s2.end());
	}
	
	for(int j=0;j<count;j++){
		std::cout<<ans[j]<<"\n";
	}
	
	return 0;
}